YES 226.87800000000001
H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/FiniteMap.hs
H-Termination of the given Haskell-Program with start terms could successfully be proven:
↳ HASKELL
↳ LR
mainModule FiniteMap
|
| ((delFromFM :: FiniteMap Bool a -> Bool -> FiniteMap Bool a) :: FiniteMap Bool a -> Bool -> FiniteMap Bool a) |
module FiniteMap where
| | import qualified Maybe
import qualified Prelude
|
| | data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b)
|
| | instance (Eq a, Eq b) => Eq (FiniteMap b a) where
|
| | delFromFM :: Ord a => FiniteMap a b -> a -> FiniteMap a b
| delFromFM | EmptyFM del_key | = | emptyFM |
| delFromFM | (Branch key elt size fm_l fm_r) del_key | |
| | | del_key > key | = |
| mkBalBranch key elt fm_l (delFromFM fm_r del_key) |
|
| | | del_key < key | = |
| mkBalBranch key elt (delFromFM fm_l del_key) fm_r |
|
| | | key == del_key | = |
|
|
|
| | deleteMax :: Ord a => FiniteMap a b -> FiniteMap a b
| deleteMax | (Branch key elt _ fm_l EmptyFM) | = | fm_l |
| deleteMax | (Branch key elt _ fm_l fm_r) | = | mkBalBranch key elt fm_l (deleteMax fm_r) |
|
| | deleteMin :: Ord a => FiniteMap a b -> FiniteMap a b
| deleteMin | (Branch key elt _ EmptyFM fm_r) | = | fm_r |
| deleteMin | (Branch key elt _ fm_l fm_r) | = | mkBalBranch key elt (deleteMin fm_l) fm_r |
|
| | emptyFM :: FiniteMap a b
|
| | findMax :: FiniteMap b a -> (b,a)
| findMax | (Branch key elt _ _ EmptyFM) | = | (key,elt) |
| findMax | (Branch key elt _ _ fm_r) | = | findMax fm_r |
|
| | findMin :: FiniteMap a b -> (a,b)
| findMin | (Branch key elt _ EmptyFM _) | = | (key,elt) |
| findMin | (Branch key elt _ fm_l _) | = | findMin fm_l |
|
| | glueBal :: Ord b => FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| glueBal | EmptyFM fm2 | = | fm2 |
| glueBal | fm1 EmptyFM | = | fm1 |
| glueBal | fm1 fm2 | |
| | | sizeFM fm2 > sizeFM fm1 | = |
| mkBalBranch mid_key2 mid_elt2 fm1 (deleteMin fm2) |
|
| | | otherwise | = |
| mkBalBranch mid_key1 mid_elt1 (deleteMax fm1) fm2 | where |
| mid_elt1 | | = | (\(_,mid_elt1) ->mid_elt1) vv2 |
|
| mid_elt2 | | = | (\(_,mid_elt2) ->mid_elt2) vv3 |
|
| mid_key1 | | = | (\(mid_key1,_) ->mid_key1) vv2 |
|
| mid_key2 | | = | (\(mid_key2,_) ->mid_key2) vv3 |
|
|
|
|
|
|
|
|
|
| | mkBalBranch :: Ord b => b -> a -> FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| mkBalBranch | key elt fm_L fm_R | |
| | | size_l + size_r < 2 | = |
| mkBranch 1 key elt fm_L fm_R |
|
| | | size_r > sIZE_RATIO * size_l | = |
| case | fm_R of |
|
| Branch _ _ _ fm_rl fm_rr | |
| | | sizeFM fm_rl < 2 * sizeFM fm_rr | -> |
|
| | | otherwise | -> |
|
|
|
|
| | | size_l > sIZE_RATIO * size_r | = |
| case | fm_L of |
|
| Branch _ _ _ fm_ll fm_lr | |
| | | sizeFM fm_lr < 2 * sizeFM fm_ll | -> |
|
| | | otherwise | -> |
|
|
|
|
| | | otherwise | = |
| mkBranch 2 key elt fm_L fm_R | where |
| double_L | fm_l (Branch key_r elt_r _ (Branch key_rl elt_rl _ fm_rll fm_rlr) fm_rr) | = | mkBranch 5 key_rl elt_rl (mkBranch 6 key elt fm_l fm_rll) (mkBranch 7 key_r elt_r fm_rlr fm_rr) |
|
| double_R | (Branch key_l elt_l _ fm_ll (Branch key_lr elt_lr _ fm_lrl fm_lrr)) fm_r | = | mkBranch 10 key_lr elt_lr (mkBranch 11 key_l elt_l fm_ll fm_lrl) (mkBranch 12 key elt fm_lrr fm_r) |
|
| single_L | fm_l (Branch key_r elt_r _ fm_rl fm_rr) | = | mkBranch 3 key_r elt_r (mkBranch 4 key elt fm_l fm_rl) fm_rr |
|
| single_R | (Branch key_l elt_l _ fm_ll fm_lr) fm_r | = | mkBranch 8 key_l elt_l fm_ll (mkBranch 9 key elt fm_lr fm_r) |
|
|
|
|
|
|
|
|
|
| | mkBranch :: Ord a => Int -> a -> b -> FiniteMap a b -> FiniteMap a b -> FiniteMap a b
| mkBranch | which key elt fm_l fm_r | = |
| let |
| result | | = | Branch key elt (unbox (1 + left_size + right_size)) fm_l fm_r |
|
|
| in | result |
| where |
|
|
| left_ok | | = |
| case | fm_l of |
|
| EmptyFM | -> | True |
|
| Branch left_key _ _ _ _ | -> |
| let |
| biggest_left_key | | = | fst (findMax fm_l) |
|
|
| in | biggest_left_key < key |
|
|
|
|
|
| right_ok | | = |
| case | fm_r of |
|
| EmptyFM | -> | True |
|
| Branch right_key _ _ _ _ | -> |
| let |
| smallest_right_key | | = | fst (findMin fm_r) |
|
|
| in | key < smallest_right_key |
|
|
|
|
|
unbox :: Int -> Int
|
|
|
|
| | sIZE_RATIO :: Int
|
| | sizeFM :: FiniteMap b a -> Int
| sizeFM | EmptyFM | = | 0 |
| sizeFM | (Branch _ _ size _ _) | = | size |
|
module Maybe where
| | import qualified FiniteMap
import qualified Prelude
|
Lambda Reductions:
The following Lambda expression
\(mid_key1,_)→mid_key1
is transformed to
| mid_key10 | (mid_key1,_) | = mid_key1 |
The following Lambda expression
\(_,mid_elt1)→mid_elt1
is transformed to
| mid_elt10 | (_,mid_elt1) | = mid_elt1 |
The following Lambda expression
\(mid_key2,_)→mid_key2
is transformed to
| mid_key20 | (mid_key2,_) | = mid_key2 |
The following Lambda expression
\(_,mid_elt2)→mid_elt2
is transformed to
| mid_elt20 | (_,mid_elt2) | = mid_elt2 |
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
mainModule FiniteMap
|
| ((delFromFM :: FiniteMap Bool a -> Bool -> FiniteMap Bool a) :: FiniteMap Bool a -> Bool -> FiniteMap Bool a) |
module FiniteMap where
| | import qualified Maybe
import qualified Prelude
|
| | data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a)
|
| | instance (Eq a, Eq b) => Eq (FiniteMap b a) where
|
| | delFromFM :: Ord b => FiniteMap b a -> b -> FiniteMap b a
| delFromFM | EmptyFM del_key | = | emptyFM |
| delFromFM | (Branch key elt size fm_l fm_r) del_key | |
| | | del_key > key | = |
| mkBalBranch key elt fm_l (delFromFM fm_r del_key) |
|
| | | del_key < key | = |
| mkBalBranch key elt (delFromFM fm_l del_key) fm_r |
|
| | | key == del_key | = |
|
|
|
| | deleteMax :: Ord a => FiniteMap a b -> FiniteMap a b
| deleteMax | (Branch key elt _ fm_l EmptyFM) | = | fm_l |
| deleteMax | (Branch key elt _ fm_l fm_r) | = | mkBalBranch key elt fm_l (deleteMax fm_r) |
|
| | deleteMin :: Ord a => FiniteMap a b -> FiniteMap a b
| deleteMin | (Branch key elt _ EmptyFM fm_r) | = | fm_r |
| deleteMin | (Branch key elt _ fm_l fm_r) | = | mkBalBranch key elt (deleteMin fm_l) fm_r |
|
| | emptyFM :: FiniteMap b a
|
| | findMax :: FiniteMap b a -> (b,a)
| findMax | (Branch key elt _ _ EmptyFM) | = | (key,elt) |
| findMax | (Branch key elt _ _ fm_r) | = | findMax fm_r |
|
| | findMin :: FiniteMap b a -> (b,a)
| findMin | (Branch key elt _ EmptyFM _) | = | (key,elt) |
| findMin | (Branch key elt _ fm_l _) | = | findMin fm_l |
|
| | glueBal :: Ord b => FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| glueBal | EmptyFM fm2 | = | fm2 |
| glueBal | fm1 EmptyFM | = | fm1 |
| glueBal | fm1 fm2 | |
| | | sizeFM fm2 > sizeFM fm1 | = |
| mkBalBranch mid_key2 mid_elt2 fm1 (deleteMin fm2) |
|
| | | otherwise | = |
| mkBalBranch mid_key1 mid_elt1 (deleteMax fm1) fm2 | where |
|
|
| mid_elt10 | (_,mid_elt1) | = | mid_elt1 |
|
|
|
| mid_elt20 | (_,mid_elt2) | = | mid_elt2 |
|
|
|
| mid_key10 | (mid_key1,_) | = | mid_key1 |
|
|
|
| mid_key20 | (mid_key2,_) | = | mid_key2 |
|
|
|
|
|
|
|
|
|
| | mkBalBranch :: Ord b => b -> a -> FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| mkBalBranch | key elt fm_L fm_R | |
| | | size_l + size_r < 2 | = |
| mkBranch 1 key elt fm_L fm_R |
|
| | | size_r > sIZE_RATIO * size_l | = |
| case | fm_R of |
|
| Branch _ _ _ fm_rl fm_rr | |
| | | sizeFM fm_rl < 2 * sizeFM fm_rr | -> |
|
| | | otherwise | -> |
|
|
|
|
| | | size_l > sIZE_RATIO * size_r | = |
| case | fm_L of |
|
| Branch _ _ _ fm_ll fm_lr | |
| | | sizeFM fm_lr < 2 * sizeFM fm_ll | -> |
|
| | | otherwise | -> |
|
|
|
|
| | | otherwise | = |
| mkBranch 2 key elt fm_L fm_R | where |
| double_L | fm_l (Branch key_r elt_r _ (Branch key_rl elt_rl _ fm_rll fm_rlr) fm_rr) | = | mkBranch 5 key_rl elt_rl (mkBranch 6 key elt fm_l fm_rll) (mkBranch 7 key_r elt_r fm_rlr fm_rr) |
|
| double_R | (Branch key_l elt_l _ fm_ll (Branch key_lr elt_lr _ fm_lrl fm_lrr)) fm_r | = | mkBranch 10 key_lr elt_lr (mkBranch 11 key_l elt_l fm_ll fm_lrl) (mkBranch 12 key elt fm_lrr fm_r) |
|
| single_L | fm_l (Branch key_r elt_r _ fm_rl fm_rr) | = | mkBranch 3 key_r elt_r (mkBranch 4 key elt fm_l fm_rl) fm_rr |
|
| single_R | (Branch key_l elt_l _ fm_ll fm_lr) fm_r | = | mkBranch 8 key_l elt_l fm_ll (mkBranch 9 key elt fm_lr fm_r) |
|
|
|
|
|
|
|
|
|
| | mkBranch :: Ord a => Int -> a -> b -> FiniteMap a b -> FiniteMap a b -> FiniteMap a b
| mkBranch | which key elt fm_l fm_r | = |
| let |
| result | | = | Branch key elt (unbox (1 + left_size + right_size)) fm_l fm_r |
|
|
| in | result |
| where |
|
|
| left_ok | | = |
| case | fm_l of |
|
| EmptyFM | -> | True |
|
| Branch left_key _ _ _ _ | -> |
| let |
| biggest_left_key | | = | fst (findMax fm_l) |
|
|
| in | biggest_left_key < key |
|
|
|
|
|
| right_ok | | = |
| case | fm_r of |
|
| EmptyFM | -> | True |
|
| Branch right_key _ _ _ _ | -> |
| let |
| smallest_right_key | | = | fst (findMin fm_r) |
|
|
| in | key < smallest_right_key |
|
|
|
|
|
unbox :: Int -> Int
|
|
|
|
| | sIZE_RATIO :: Int
|
| | sizeFM :: FiniteMap b a -> Int
| sizeFM | EmptyFM | = | 0 |
| sizeFM | (Branch _ _ size _ _) | = | size |
|
module Maybe where
| | import qualified FiniteMap
import qualified Prelude
|
Case Reductions:
The following Case expression
| case | fm_l of |
| | EmptyFM | → True |
| | Branch left_key _ _ _ _ | →
| let |
| biggest_left_key | | = fst (findMax fm_l) |
|
in | biggest_left_key < key |
|
is transformed to
| left_ok0 | fm_l key EmptyFM | = True |
| left_ok0 | fm_l key (Branch left_key _ _ _ _) | =
| let |
| biggest_left_key | | = fst (findMax fm_l) |
|
in | biggest_left_key < key |
|
The following Case expression
| case | fm_r of |
| | EmptyFM | → True |
| | Branch right_key _ _ _ _ | →
| let |
| smallest_right_key | | = fst (findMin fm_r) |
|
in | key < smallest_right_key |
|
is transformed to
| right_ok0 | fm_r key EmptyFM | = True |
| right_ok0 | fm_r key (Branch right_key _ _ _ _) | =
| let |
| smallest_right_key | | = fst (findMin fm_r) |
|
in | key < smallest_right_key |
|
The following Case expression
| case | fm_R of |
| | Branch _ _ _ fm_rl fm_rr |
| | | sizeFM fm_rl < 2 * sizeFM fm_rr | |
| | | otherwise | |
|
is transformed to
| mkBalBranch0 | fm_L fm_R (Branch _ _ _ fm_rl fm_rr) |
| | | sizeFM fm_rl < 2 * sizeFM fm_rr | |
| | | otherwise | |
|
The following Case expression
| case | fm_L of |
| | Branch _ _ _ fm_ll fm_lr |
| | | sizeFM fm_lr < 2 * sizeFM fm_ll | |
| | | otherwise | |
|
is transformed to
| mkBalBranch1 | fm_L fm_R (Branch _ _ _ fm_ll fm_lr) |
| | | sizeFM fm_lr < 2 * sizeFM fm_ll | |
| | | otherwise | |
|
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
mainModule FiniteMap
|
| ((delFromFM :: FiniteMap Bool a -> Bool -> FiniteMap Bool a) :: FiniteMap Bool a -> Bool -> FiniteMap Bool a) |
module FiniteMap where
| | import qualified Maybe
import qualified Prelude
|
| | data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b)
|
| | instance (Eq a, Eq b) => Eq (FiniteMap a b) where
|
| | delFromFM :: Ord b => FiniteMap b a -> b -> FiniteMap b a
| delFromFM | EmptyFM del_key | = | emptyFM |
| delFromFM | (Branch key elt size fm_l fm_r) del_key | |
| | | del_key > key | = |
| mkBalBranch key elt fm_l (delFromFM fm_r del_key) |
|
| | | del_key < key | = |
| mkBalBranch key elt (delFromFM fm_l del_key) fm_r |
|
| | | key == del_key | = |
|
|
|
| | deleteMax :: Ord b => FiniteMap b a -> FiniteMap b a
| deleteMax | (Branch key elt _ fm_l EmptyFM) | = | fm_l |
| deleteMax | (Branch key elt _ fm_l fm_r) | = | mkBalBranch key elt fm_l (deleteMax fm_r) |
|
| | deleteMin :: Ord a => FiniteMap a b -> FiniteMap a b
| deleteMin | (Branch key elt _ EmptyFM fm_r) | = | fm_r |
| deleteMin | (Branch key elt _ fm_l fm_r) | = | mkBalBranch key elt (deleteMin fm_l) fm_r |
|
| | emptyFM :: FiniteMap b a
|
| | findMax :: FiniteMap b a -> (b,a)
| findMax | (Branch key elt _ _ EmptyFM) | = | (key,elt) |
| findMax | (Branch key elt _ _ fm_r) | = | findMax fm_r |
|
| | findMin :: FiniteMap a b -> (a,b)
| findMin | (Branch key elt _ EmptyFM _) | = | (key,elt) |
| findMin | (Branch key elt _ fm_l _) | = | findMin fm_l |
|
| | glueBal :: Ord b => FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| glueBal | EmptyFM fm2 | = | fm2 |
| glueBal | fm1 EmptyFM | = | fm1 |
| glueBal | fm1 fm2 | |
| | | sizeFM fm2 > sizeFM fm1 | = |
| mkBalBranch mid_key2 mid_elt2 fm1 (deleteMin fm2) |
|
| | | otherwise | = |
| mkBalBranch mid_key1 mid_elt1 (deleteMax fm1) fm2 | where |
|
|
| mid_elt10 | (_,mid_elt1) | = | mid_elt1 |
|
|
|
| mid_elt20 | (_,mid_elt2) | = | mid_elt2 |
|
|
|
| mid_key10 | (mid_key1,_) | = | mid_key1 |
|
|
|
| mid_key20 | (mid_key2,_) | = | mid_key2 |
|
|
|
|
|
|
|
|
|
| | mkBalBranch :: Ord a => a -> b -> FiniteMap a b -> FiniteMap a b -> FiniteMap a b
| mkBalBranch | key elt fm_L fm_R | |
| | | size_l + size_r < 2 | = |
| mkBranch 1 key elt fm_L fm_R |
|
| | | size_r > sIZE_RATIO * size_l | = |
| mkBalBranch0 fm_L fm_R fm_R |
|
| | | size_l > sIZE_RATIO * size_r | = |
| mkBalBranch1 fm_L fm_R fm_L |
|
| | | otherwise | = |
| mkBranch 2 key elt fm_L fm_R | where |
| double_L | fm_l (Branch key_r elt_r _ (Branch key_rl elt_rl _ fm_rll fm_rlr) fm_rr) | = | mkBranch 5 key_rl elt_rl (mkBranch 6 key elt fm_l fm_rll) (mkBranch 7 key_r elt_r fm_rlr fm_rr) |
|
| double_R | (Branch key_l elt_l _ fm_ll (Branch key_lr elt_lr _ fm_lrl fm_lrr)) fm_r | = | mkBranch 10 key_lr elt_lr (mkBranch 11 key_l elt_l fm_ll fm_lrl) (mkBranch 12 key elt fm_lrr fm_r) |
|
| mkBalBranch0 | fm_L fm_R (Branch _ _ _ fm_rl fm_rr) | |
| | | sizeFM fm_rl < 2 * sizeFM fm_rr | = |
|
| | | otherwise | = |
|
|
|
| mkBalBranch1 | fm_L fm_R (Branch _ _ _ fm_ll fm_lr) | |
| | | sizeFM fm_lr < 2 * sizeFM fm_ll | = |
|
| | | otherwise | = |
|
|
|
| single_L | fm_l (Branch key_r elt_r _ fm_rl fm_rr) | = | mkBranch 3 key_r elt_r (mkBranch 4 key elt fm_l fm_rl) fm_rr |
|
| single_R | (Branch key_l elt_l _ fm_ll fm_lr) fm_r | = | mkBranch 8 key_l elt_l fm_ll (mkBranch 9 key elt fm_lr fm_r) |
|
|
|
|
|
|
|
|
|
| | mkBranch :: Ord a => Int -> a -> b -> FiniteMap a b -> FiniteMap a b -> FiniteMap a b
| mkBranch | which key elt fm_l fm_r | = |
| let |
| result | | = | Branch key elt (unbox (1 + left_size + right_size)) fm_l fm_r |
|
|
| in | result |
| where |
|
|
| left_ok | | = | left_ok0 fm_l key fm_l |
|
| left_ok0 | fm_l key EmptyFM | = | True |
| left_ok0 | fm_l key (Branch left_key _ _ _ _) | = |
| let |
| biggest_left_key | | = | fst (findMax fm_l) |
|
|
| in | biggest_left_key < key |
|
|
|
|
| right_ok | | = | right_ok0 fm_r key fm_r |
|
| right_ok0 | fm_r key EmptyFM | = | True |
| right_ok0 | fm_r key (Branch right_key _ _ _ _) | = |
| let |
| smallest_right_key | | = | fst (findMin fm_r) |
|
|
| in | key < smallest_right_key |
|
|
|
|
unbox :: Int -> Int
|
|
|
|
| | sIZE_RATIO :: Int
|
| | sizeFM :: FiniteMap b a -> Int
| sizeFM | EmptyFM | = | 0 |
| sizeFM | (Branch _ _ size _ _) | = | size |
|
module Maybe where
| | import qualified FiniteMap
import qualified Prelude
|
Replaced joker patterns by fresh variables and removed binding patterns.
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
mainModule FiniteMap
|
| ((delFromFM :: FiniteMap Bool a -> Bool -> FiniteMap Bool a) :: FiniteMap Bool a -> Bool -> FiniteMap Bool a) |
module FiniteMap where
| | import qualified Maybe
import qualified Prelude
|
| | data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a)
|
| | instance (Eq a, Eq b) => Eq (FiniteMap a b) where
|
| | delFromFM :: Ord b => FiniteMap b a -> b -> FiniteMap b a
| delFromFM | EmptyFM del_key | = | emptyFM |
| delFromFM | (Branch key elt size fm_l fm_r) del_key | |
| | | del_key > key | = |
| mkBalBranch key elt fm_l (delFromFM fm_r del_key) |
|
| | | del_key < key | = |
| mkBalBranch key elt (delFromFM fm_l del_key) fm_r |
|
| | | key == del_key | = |
|
|
|
| | deleteMax :: Ord a => FiniteMap a b -> FiniteMap a b
| deleteMax | (Branch key elt zy fm_l EmptyFM) | = | fm_l |
| deleteMax | (Branch key elt zz fm_l fm_r) | = | mkBalBranch key elt fm_l (deleteMax fm_r) |
|
| | deleteMin :: Ord b => FiniteMap b a -> FiniteMap b a
| deleteMin | (Branch key elt yy EmptyFM fm_r) | = | fm_r |
| deleteMin | (Branch key elt yz fm_l fm_r) | = | mkBalBranch key elt (deleteMin fm_l) fm_r |
|
| | emptyFM :: FiniteMap a b
|
| | findMax :: FiniteMap b a -> (b,a)
| findMax | (Branch key elt xw xx EmptyFM) | = | (key,elt) |
| findMax | (Branch key elt xy xz fm_r) | = | findMax fm_r |
|
| | findMin :: FiniteMap a b -> (a,b)
| findMin | (Branch key elt wy EmptyFM wz) | = | (key,elt) |
| findMin | (Branch key elt xu fm_l xv) | = | findMin fm_l |
|
| | glueBal :: Ord b => FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| glueBal | EmptyFM fm2 | = | fm2 |
| glueBal | fm1 EmptyFM | = | fm1 |
| glueBal | fm1 fm2 | |
| | | sizeFM fm2 > sizeFM fm1 | = |
| mkBalBranch mid_key2 mid_elt2 fm1 (deleteMin fm2) |
|
| | | otherwise | = |
| mkBalBranch mid_key1 mid_elt1 (deleteMax fm1) fm2 | where |
|
|
| mid_elt10 | (yu,mid_elt1) | = | mid_elt1 |
|
|
|
| mid_elt20 | (yv,mid_elt2) | = | mid_elt2 |
|
|
|
| mid_key10 | (mid_key1,yw) | = | mid_key1 |
|
|
|
| mid_key20 | (mid_key2,yx) | = | mid_key2 |
|
|
|
|
|
|
|
|
|
| | mkBalBranch :: Ord a => a -> b -> FiniteMap a b -> FiniteMap a b -> FiniteMap a b
| mkBalBranch | key elt fm_L fm_R | |
| | | size_l + size_r < 2 | = |
| mkBranch 1 key elt fm_L fm_R |
|
| | | size_r > sIZE_RATIO * size_l | = |
| mkBalBranch0 fm_L fm_R fm_R |
|
| | | size_l > sIZE_RATIO * size_r | = |
| mkBalBranch1 fm_L fm_R fm_L |
|
| | | otherwise | = |
| mkBranch 2 key elt fm_L fm_R | where |
| double_L | fm_l (Branch key_r elt_r vvu (Branch key_rl elt_rl vvv fm_rll fm_rlr) fm_rr) | = | mkBranch 5 key_rl elt_rl (mkBranch 6 key elt fm_l fm_rll) (mkBranch 7 key_r elt_r fm_rlr fm_rr) |
|
| double_R | (Branch key_l elt_l vuy fm_ll (Branch key_lr elt_lr vuz fm_lrl fm_lrr)) fm_r | = | mkBranch 10 key_lr elt_lr (mkBranch 11 key_l elt_l fm_ll fm_lrl) (mkBranch 12 key elt fm_lrr fm_r) |
|
| mkBalBranch0 | fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | |
| | | sizeFM fm_rl < 2 * sizeFM fm_rr | = |
|
| | | otherwise | = |
|
|
|
| mkBalBranch1 | fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | |
| | | sizeFM fm_lr < 2 * sizeFM fm_ll | = |
|
| | | otherwise | = |
|
|
|
| single_L | fm_l (Branch key_r elt_r vvz fm_rl fm_rr) | = | mkBranch 3 key_r elt_r (mkBranch 4 key elt fm_l fm_rl) fm_rr |
|
| single_R | (Branch key_l elt_l vuu fm_ll fm_lr) fm_r | = | mkBranch 8 key_l elt_l fm_ll (mkBranch 9 key elt fm_lr fm_r) |
|
|
|
|
|
|
|
|
|
| | mkBranch :: Ord a => Int -> a -> b -> FiniteMap a b -> FiniteMap a b -> FiniteMap a b
| mkBranch | which key elt fm_l fm_r | = |
| let |
| result | | = | Branch key elt (unbox (1 + left_size + right_size)) fm_l fm_r |
|
|
| in | result |
| where |
|
|
| left_ok | | = | left_ok0 fm_l key fm_l |
|
| left_ok0 | fm_l key EmptyFM | = | True |
| left_ok0 | fm_l key (Branch left_key wu wv ww wx) | = |
| let |
| biggest_left_key | | = | fst (findMax fm_l) |
|
|
| in | biggest_left_key < key |
|
|
|
|
| right_ok | | = | right_ok0 fm_r key fm_r |
|
| right_ok0 | fm_r key EmptyFM | = | True |
| right_ok0 | fm_r key (Branch right_key vw vx vy vz) | = |
| let |
| smallest_right_key | | = | fst (findMin fm_r) |
|
|
| in | key < smallest_right_key |
|
|
|
|
unbox :: Int -> Int
|
|
|
|
| | sIZE_RATIO :: Int
|
| | sizeFM :: FiniteMap b a -> Int
| sizeFM | EmptyFM | = | 0 |
| sizeFM | (Branch zu zv size zw zx) | = | size |
|
module Maybe where
| | import qualified FiniteMap
import qualified Prelude
|
Cond Reductions:
The following Function with conditions
| glueBal | EmptyFM fm2 | = fm2 |
| glueBal | fm1 EmptyFM | = fm1 |
| glueBal | fm1 fm2 |
| | | sizeFM fm2 > sizeFM fm1 |
| = | mkBalBranch mid_key2 mid_elt2 fm1 (deleteMin fm2) |
|
| | | otherwise |
| = | mkBalBranch mid_key1 mid_elt1 (deleteMax fm1) fm2 |
|
|
| where | |
|
| mid_elt10 | (yu,mid_elt1) | = mid_elt1 |
|
| |
|
| mid_elt20 | (yv,mid_elt2) | = mid_elt2 |
|
| |
|
| mid_key10 | (mid_key1,yw) | = mid_key1 |
|
| |
|
| mid_key20 | (mid_key2,yx) | = mid_key2 |
|
| |
| |
|
is transformed to
| glueBal | EmptyFM fm2 | = glueBal4 EmptyFM fm2 |
| glueBal | fm1 EmptyFM | = glueBal3 fm1 EmptyFM |
| glueBal | fm1 fm2 | = glueBal2 fm1 fm2 |
| glueBal2 | fm1 fm2 | =
| glueBal1 fm1 fm2 (sizeFM fm2 > sizeFM fm1) |
| where |
| glueBal0 | fm1 fm2 True | = mkBalBranch mid_key1 mid_elt1 (deleteMax fm1) fm2 |
|
|
| glueBal1 | fm1 fm2 True | = mkBalBranch mid_key2 mid_elt2 fm1 (deleteMin fm2) |
| glueBal1 | fm1 fm2 False | = glueBal0 fm1 fm2 otherwise |
|
| |
|
| mid_elt10 | (yu,mid_elt1) | = mid_elt1 |
|
| |
|
| mid_elt20 | (yv,mid_elt2) | = mid_elt2 |
|
| |
|
| mid_key10 | (mid_key1,yw) | = mid_key1 |
|
| |
|
| mid_key20 | (mid_key2,yx) | = mid_key2 |
|
| |
| |
|
| glueBal3 | fm1 EmptyFM | = fm1 |
| glueBal3 | vwy vwz | = glueBal2 vwy vwz |
| glueBal4 | EmptyFM fm2 | = fm2 |
| glueBal4 | vxv vxw | = glueBal3 vxv vxw |
The following Function with conditions
| delFromFM | EmptyFM del_key | = emptyFM |
| delFromFM | (Branch key elt size fm_l fm_r) del_key |
| | | del_key > key |
| = | mkBalBranch key elt fm_l (delFromFM fm_r del_key) |
|
| | | del_key < key |
| = | mkBalBranch key elt (delFromFM fm_l del_key) fm_r |
|
| | | key == del_key | |
|
is transformed to
| delFromFM | EmptyFM del_key | = delFromFM4 EmptyFM del_key |
| delFromFM | (Branch key elt size fm_l fm_r) del_key | = delFromFM3 (Branch key elt size fm_l fm_r) del_key |
| delFromFM0 | key elt size fm_l fm_r del_key True | = glueBal fm_l fm_r |
| delFromFM2 | key elt size fm_l fm_r del_key True | = mkBalBranch key elt fm_l (delFromFM fm_r del_key) |
| delFromFM2 | key elt size fm_l fm_r del_key False | = delFromFM1 key elt size fm_l fm_r del_key (del_key < key) |
| delFromFM1 | key elt size fm_l fm_r del_key True | = mkBalBranch key elt (delFromFM fm_l del_key) fm_r |
| delFromFM1 | key elt size fm_l fm_r del_key False | = delFromFM0 key elt size fm_l fm_r del_key (key == del_key) |
| delFromFM3 | (Branch key elt size fm_l fm_r) del_key | = delFromFM2 key elt size fm_l fm_r del_key (del_key > key) |
| delFromFM4 | EmptyFM del_key | = emptyFM |
| delFromFM4 | vxz vyu | = delFromFM3 vxz vyu |
The following Function with conditions
| mkBalBranch1 | fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) |
| | | sizeFM fm_lr < 2 * sizeFM fm_ll | |
| | | otherwise | |
|
is transformed to
| mkBalBranch1 | fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = mkBalBranch12 fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) |
| mkBalBranch11 | fm_L fm_R vuv vuw vux fm_ll fm_lr True | = single_R fm_L fm_R |
| mkBalBranch11 | fm_L fm_R vuv vuw vux fm_ll fm_lr False | = mkBalBranch10 fm_L fm_R vuv vuw vux fm_ll fm_lr otherwise |
| mkBalBranch10 | fm_L fm_R vuv vuw vux fm_ll fm_lr True | = double_R fm_L fm_R |
| mkBalBranch12 | fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = mkBalBranch11 fm_L fm_R vuv vuw vux fm_ll fm_lr (sizeFM fm_lr < 2 * sizeFM fm_ll) |
The following Function with conditions
| mkBalBranch0 | fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) |
| | | sizeFM fm_rl < 2 * sizeFM fm_rr | |
| | | otherwise | |
|
is transformed to
| mkBalBranch0 | fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = mkBalBranch02 fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) |
| mkBalBranch01 | fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = single_L fm_L fm_R |
| mkBalBranch01 | fm_L fm_R vvw vvx vvy fm_rl fm_rr False | = mkBalBranch00 fm_L fm_R vvw vvx vvy fm_rl fm_rr otherwise |
| mkBalBranch00 | fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = double_L fm_L fm_R |
| mkBalBranch02 | fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = mkBalBranch01 fm_L fm_R vvw vvx vvy fm_rl fm_rr (sizeFM fm_rl < 2 * sizeFM fm_rr) |
The following Function with conditions
| mkBalBranch | key elt fm_L fm_R |
| | | size_l + size_r < 2 |
| = | mkBranch 1 key elt fm_L fm_R |
|
| | | size_r > sIZE_RATIO * size_l |
| = | mkBalBranch0 fm_L fm_R fm_R |
|
| | | size_l > sIZE_RATIO * size_r |
| = | mkBalBranch1 fm_L fm_R fm_L |
|
| | | otherwise |
| = | mkBranch 2 key elt fm_L fm_R |
|
|
| where |
| double_L | fm_l (Branch key_r elt_r vvu (Branch key_rl elt_rl vvv fm_rll fm_rlr) fm_rr) | = mkBranch 5 key_rl elt_rl (mkBranch 6 key elt fm_l fm_rll) (mkBranch 7 key_r elt_r fm_rlr fm_rr) |
|
|
| double_R | (Branch key_l elt_l vuy fm_ll (Branch key_lr elt_lr vuz fm_lrl fm_lrr)) fm_r | = mkBranch 10 key_lr elt_lr (mkBranch 11 key_l elt_l fm_ll fm_lrl) (mkBranch 12 key elt fm_lrr fm_r) |
|
|
| mkBalBranch0 | fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) |
| | | sizeFM fm_rl < 2 * sizeFM fm_rr | |
| | | otherwise | |
|
|
|
| mkBalBranch1 | fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) |
| | | sizeFM fm_lr < 2 * sizeFM fm_ll | |
| | | otherwise | |
|
|
|
| single_L | fm_l (Branch key_r elt_r vvz fm_rl fm_rr) | = mkBranch 3 key_r elt_r (mkBranch 4 key elt fm_l fm_rl) fm_rr |
|
|
| single_R | (Branch key_l elt_l vuu fm_ll fm_lr) fm_r | = mkBranch 8 key_l elt_l fm_ll (mkBranch 9 key elt fm_lr fm_r) |
|
| |
| |
|
is transformed to
| mkBalBranch | key elt fm_L fm_R | = mkBalBranch6 key elt fm_L fm_R |
| mkBalBranch6 | key elt fm_L fm_R | =
| mkBalBranch5 key elt fm_L fm_R (size_l + size_r < 2) |
| where |
| double_L | fm_l (Branch key_r elt_r vvu (Branch key_rl elt_rl vvv fm_rll fm_rlr) fm_rr) | = mkBranch 5 key_rl elt_rl (mkBranch 6 key elt fm_l fm_rll) (mkBranch 7 key_r elt_r fm_rlr fm_rr) |
|
|
| double_R | (Branch key_l elt_l vuy fm_ll (Branch key_lr elt_lr vuz fm_lrl fm_lrr)) fm_r | = mkBranch 10 key_lr elt_lr (mkBranch 11 key_l elt_l fm_ll fm_lrl) (mkBranch 12 key elt fm_lrr fm_r) |
|
|
| mkBalBranch0 | fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = mkBalBranch02 fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) |
|
|
| mkBalBranch00 | fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = double_L fm_L fm_R |
|
|
| mkBalBranch01 | fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = single_L fm_L fm_R |
| mkBalBranch01 | fm_L fm_R vvw vvx vvy fm_rl fm_rr False | = mkBalBranch00 fm_L fm_R vvw vvx vvy fm_rl fm_rr otherwise |
|
|
| mkBalBranch02 | fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = mkBalBranch01 fm_L fm_R vvw vvx vvy fm_rl fm_rr (sizeFM fm_rl < 2 * sizeFM fm_rr) |
|
|
| mkBalBranch1 | fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = mkBalBranch12 fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) |
|
|
| mkBalBranch10 | fm_L fm_R vuv vuw vux fm_ll fm_lr True | = double_R fm_L fm_R |
|
|
| mkBalBranch11 | fm_L fm_R vuv vuw vux fm_ll fm_lr True | = single_R fm_L fm_R |
| mkBalBranch11 | fm_L fm_R vuv vuw vux fm_ll fm_lr False | = mkBalBranch10 fm_L fm_R vuv vuw vux fm_ll fm_lr otherwise |
|
|
| mkBalBranch12 | fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = mkBalBranch11 fm_L fm_R vuv vuw vux fm_ll fm_lr (sizeFM fm_lr < 2 * sizeFM fm_ll) |
|
|
| mkBalBranch2 | key elt fm_L fm_R True | = mkBranch 2 key elt fm_L fm_R |
|
|
| mkBalBranch3 | key elt fm_L fm_R True | = mkBalBranch1 fm_L fm_R fm_L |
| mkBalBranch3 | key elt fm_L fm_R False | = mkBalBranch2 key elt fm_L fm_R otherwise |
|
|
| mkBalBranch4 | key elt fm_L fm_R True | = mkBalBranch0 fm_L fm_R fm_R |
| mkBalBranch4 | key elt fm_L fm_R False | = mkBalBranch3 key elt fm_L fm_R (size_l > sIZE_RATIO * size_r) |
|
|
| mkBalBranch5 | key elt fm_L fm_R True | = mkBranch 1 key elt fm_L fm_R |
| mkBalBranch5 | key elt fm_L fm_R False | = mkBalBranch4 key elt fm_L fm_R (size_r > sIZE_RATIO * size_l) |
|
|
| single_L | fm_l (Branch key_r elt_r vvz fm_rl fm_rr) | = mkBranch 3 key_r elt_r (mkBranch 4 key elt fm_l fm_rl) fm_rr |
|
|
| single_R | (Branch key_l elt_l vuu fm_ll fm_lr) fm_r | = mkBranch 8 key_l elt_l fm_ll (mkBranch 9 key elt fm_lr fm_r) |
|
| |
| |
|
The following Function with conditions
| compare | x y |
| | | x == y | |
| | | x <= y | |
| | | otherwise | |
|
is transformed to
| compare | x y | = compare3 x y |
| compare1 | x y True | = LT |
| compare1 | x y False | = compare0 x y otherwise |
| compare2 | x y True | = EQ |
| compare2 | x y False | = compare1 x y (x <= y) |
| compare3 | x y | = compare2 x y (x == y) |
The following Function with conditions
is transformed to
| undefined0 | True | = undefined |
| undefined1 | | = undefined0 False |
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
mainModule FiniteMap
|
| ((delFromFM :: FiniteMap Bool a -> Bool -> FiniteMap Bool a) :: FiniteMap Bool a -> Bool -> FiniteMap Bool a) |
module FiniteMap where
| | import qualified Maybe
import qualified Prelude
|
| | data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b)
|
| | instance (Eq a, Eq b) => Eq (FiniteMap a b) where
|
| | delFromFM :: Ord a => FiniteMap a b -> a -> FiniteMap a b
| delFromFM | EmptyFM del_key | = | delFromFM4 EmptyFM del_key |
| delFromFM | (Branch key elt size fm_l fm_r) del_key | = | delFromFM3 (Branch key elt size fm_l fm_r) del_key |
|
| |
| delFromFM0 | key elt size fm_l fm_r del_key True | = | glueBal fm_l fm_r |
|
| |
| delFromFM1 | key elt size fm_l fm_r del_key True | = | mkBalBranch key elt (delFromFM fm_l del_key) fm_r |
| delFromFM1 | key elt size fm_l fm_r del_key False | = | delFromFM0 key elt size fm_l fm_r del_key (key == del_key) |
|
| |
| delFromFM2 | key elt size fm_l fm_r del_key True | = | mkBalBranch key elt fm_l (delFromFM fm_r del_key) |
| delFromFM2 | key elt size fm_l fm_r del_key False | = | delFromFM1 key elt size fm_l fm_r del_key (del_key < key) |
|
| |
| delFromFM3 | (Branch key elt size fm_l fm_r) del_key | = | delFromFM2 key elt size fm_l fm_r del_key (del_key > key) |
|
| |
| delFromFM4 | EmptyFM del_key | = | emptyFM |
| delFromFM4 | vxz vyu | = | delFromFM3 vxz vyu |
|
| | deleteMax :: Ord a => FiniteMap a b -> FiniteMap a b
| deleteMax | (Branch key elt zy fm_l EmptyFM) | = | fm_l |
| deleteMax | (Branch key elt zz fm_l fm_r) | = | mkBalBranch key elt fm_l (deleteMax fm_r) |
|
| | deleteMin :: Ord a => FiniteMap a b -> FiniteMap a b
| deleteMin | (Branch key elt yy EmptyFM fm_r) | = | fm_r |
| deleteMin | (Branch key elt yz fm_l fm_r) | = | mkBalBranch key elt (deleteMin fm_l) fm_r |
|
| | emptyFM :: FiniteMap a b
|
| | findMax :: FiniteMap a b -> (a,b)
| findMax | (Branch key elt xw xx EmptyFM) | = | (key,elt) |
| findMax | (Branch key elt xy xz fm_r) | = | findMax fm_r |
|
| | findMin :: FiniteMap b a -> (b,a)
| findMin | (Branch key elt wy EmptyFM wz) | = | (key,elt) |
| findMin | (Branch key elt xu fm_l xv) | = | findMin fm_l |
|
| | glueBal :: Ord a => FiniteMap a b -> FiniteMap a b -> FiniteMap a b
| glueBal | EmptyFM fm2 | = | glueBal4 EmptyFM fm2 |
| glueBal | fm1 EmptyFM | = | glueBal3 fm1 EmptyFM |
| glueBal | fm1 fm2 | = | glueBal2 fm1 fm2 |
|
| |
| glueBal2 | fm1 fm2 | = |
| glueBal1 fm1 fm2 (sizeFM fm2 > sizeFM fm1) | where |
| glueBal0 | fm1 fm2 True | = | mkBalBranch mid_key1 mid_elt1 (deleteMax fm1) fm2 |
|
| glueBal1 | fm1 fm2 True | = | mkBalBranch mid_key2 mid_elt2 fm1 (deleteMin fm2) |
| glueBal1 | fm1 fm2 False | = | glueBal0 fm1 fm2 otherwise |
|
|
|
| mid_elt10 | (yu,mid_elt1) | = | mid_elt1 |
|
|
|
| mid_elt20 | (yv,mid_elt2) | = | mid_elt2 |
|
|
|
| mid_key10 | (mid_key1,yw) | = | mid_key1 |
|
|
|
| mid_key20 | (mid_key2,yx) | = | mid_key2 |
|
|
|
|
|
|
|
|
| |
| glueBal3 | fm1 EmptyFM | = | fm1 |
| glueBal3 | vwy vwz | = | glueBal2 vwy vwz |
|
| |
| glueBal4 | EmptyFM fm2 | = | fm2 |
| glueBal4 | vxv vxw | = | glueBal3 vxv vxw |
|
| | mkBalBranch :: Ord b => b -> a -> FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| mkBalBranch | key elt fm_L fm_R | = | mkBalBranch6 key elt fm_L fm_R |
|
| |
| mkBalBranch6 | key elt fm_L fm_R | = |
| mkBalBranch5 key elt fm_L fm_R (size_l + size_r < 2) | where |
| double_L | fm_l (Branch key_r elt_r vvu (Branch key_rl elt_rl vvv fm_rll fm_rlr) fm_rr) | = | mkBranch 5 key_rl elt_rl (mkBranch 6 key elt fm_l fm_rll) (mkBranch 7 key_r elt_r fm_rlr fm_rr) |
|
| double_R | (Branch key_l elt_l vuy fm_ll (Branch key_lr elt_lr vuz fm_lrl fm_lrr)) fm_r | = | mkBranch 10 key_lr elt_lr (mkBranch 11 key_l elt_l fm_ll fm_lrl) (mkBranch 12 key elt fm_lrr fm_r) |
|
| mkBalBranch0 | fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = | mkBalBranch02 fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) |
|
| mkBalBranch00 | fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = | double_L fm_L fm_R |
|
| mkBalBranch01 | fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = | single_L fm_L fm_R |
| mkBalBranch01 | fm_L fm_R vvw vvx vvy fm_rl fm_rr False | = | mkBalBranch00 fm_L fm_R vvw vvx vvy fm_rl fm_rr otherwise |
|
| mkBalBranch02 | fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = | mkBalBranch01 fm_L fm_R vvw vvx vvy fm_rl fm_rr (sizeFM fm_rl < 2 * sizeFM fm_rr) |
|
| mkBalBranch1 | fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = | mkBalBranch12 fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) |
|
| mkBalBranch10 | fm_L fm_R vuv vuw vux fm_ll fm_lr True | = | double_R fm_L fm_R |
|
| mkBalBranch11 | fm_L fm_R vuv vuw vux fm_ll fm_lr True | = | single_R fm_L fm_R |
| mkBalBranch11 | fm_L fm_R vuv vuw vux fm_ll fm_lr False | = | mkBalBranch10 fm_L fm_R vuv vuw vux fm_ll fm_lr otherwise |
|
| mkBalBranch12 | fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = | mkBalBranch11 fm_L fm_R vuv vuw vux fm_ll fm_lr (sizeFM fm_lr < 2 * sizeFM fm_ll) |
|
| mkBalBranch2 | key elt fm_L fm_R True | = | mkBranch 2 key elt fm_L fm_R |
|
| mkBalBranch3 | key elt fm_L fm_R True | = | mkBalBranch1 fm_L fm_R fm_L |
| mkBalBranch3 | key elt fm_L fm_R False | = | mkBalBranch2 key elt fm_L fm_R otherwise |
|
| mkBalBranch4 | key elt fm_L fm_R True | = | mkBalBranch0 fm_L fm_R fm_R |
| mkBalBranch4 | key elt fm_L fm_R False | = | mkBalBranch3 key elt fm_L fm_R (size_l > sIZE_RATIO * size_r) |
|
| mkBalBranch5 | key elt fm_L fm_R True | = | mkBranch 1 key elt fm_L fm_R |
| mkBalBranch5 | key elt fm_L fm_R False | = | mkBalBranch4 key elt fm_L fm_R (size_r > sIZE_RATIO * size_l) |
|
| single_L | fm_l (Branch key_r elt_r vvz fm_rl fm_rr) | = | mkBranch 3 key_r elt_r (mkBranch 4 key elt fm_l fm_rl) fm_rr |
|
| single_R | (Branch key_l elt_l vuu fm_ll fm_lr) fm_r | = | mkBranch 8 key_l elt_l fm_ll (mkBranch 9 key elt fm_lr fm_r) |
|
|
|
|
|
|
|
|
| | mkBranch :: Ord b => Int -> b -> a -> FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| mkBranch | which key elt fm_l fm_r | = |
| let |
| result | | = | Branch key elt (unbox (1 + left_size + right_size)) fm_l fm_r |
|
|
| in | result |
| where |
|
|
| left_ok | | = | left_ok0 fm_l key fm_l |
|
| left_ok0 | fm_l key EmptyFM | = | True |
| left_ok0 | fm_l key (Branch left_key wu wv ww wx) | = |
| let |
| biggest_left_key | | = | fst (findMax fm_l) |
|
|
| in | biggest_left_key < key |
|
|
|
|
| right_ok | | = | right_ok0 fm_r key fm_r |
|
| right_ok0 | fm_r key EmptyFM | = | True |
| right_ok0 | fm_r key (Branch right_key vw vx vy vz) | = |
| let |
| smallest_right_key | | = | fst (findMin fm_r) |
|
|
| in | key < smallest_right_key |
|
|
|
|
unbox :: Int -> Int
|
|
|
|
| | sIZE_RATIO :: Int
|
| | sizeFM :: FiniteMap a b -> Int
| sizeFM | EmptyFM | = | 0 |
| sizeFM | (Branch zu zv size zw zx) | = | size |
|
module Maybe where
| | import qualified FiniteMap
import qualified Prelude
|
Let/Where Reductions:
The bindings of the following Let/Where expression
| let |
| result | | = Branch key elt (unbox (1 + left_size + right_size)) fm_l fm_r |
|
in | result |
|
| where | |
|
| left_ok | | = left_ok0 fm_l key fm_l |
|
|
| left_ok0 | fm_l key EmptyFM | = True |
| left_ok0 | fm_l key (Branch left_key wu wv ww wx) | =
| let |
| biggest_left_key | | = fst (findMax fm_l) |
|
in | biggest_left_key < key |
|
|
| |
|
| right_ok | | = right_ok0 fm_r key fm_r |
|
|
| right_ok0 | fm_r key EmptyFM | = True |
| right_ok0 | fm_r key (Branch right_key vw vx vy vz) | =
| let |
| smallest_right_key | | = fst (findMin fm_r) |
|
in | key < smallest_right_key |
|
|
| |
| |
are unpacked to the following functions on top level
| mkBranchLeft_ok | vyx vyy vyz | = mkBranchLeft_ok0 vyx vyy vyz vyx vyy vyx |
| mkBranchLeft_ok0 | vyx vyy vyz fm_l key EmptyFM | = True |
| mkBranchLeft_ok0 | vyx vyy vyz fm_l key (Branch left_key wu wv ww wx) | = mkBranchLeft_ok0Biggest_left_key fm_l < key |
| mkBranchUnbox | vyx vyy vyz x | = x |
| mkBranchLeft_size | vyx vyy vyz | = sizeFM vyx |
| mkBranchBalance_ok | vyx vyy vyz | = True |
| mkBranchRight_size | vyx vyy vyz | = sizeFM vyz |
| mkBranchRight_ok | vyx vyy vyz | = mkBranchRight_ok0 vyx vyy vyz vyz vyy vyz |
| mkBranchRight_ok0 | vyx vyy vyz fm_r key EmptyFM | = True |
| mkBranchRight_ok0 | vyx vyy vyz fm_r key (Branch right_key vw vx vy vz) | = key < mkBranchRight_ok0Smallest_right_key fm_r |
The bindings of the following Let/Where expression
| let |
| result | | = Branch key elt (unbox (1 + left_size + right_size)) fm_l fm_r |
|
in | result |
are unpacked to the following functions on top level
| mkBranchResult | vzu vzv vzw vzx | = Branch vzu vzv (mkBranchUnbox vzw vzu vzx (1 + mkBranchLeft_size vzw vzu vzx + mkBranchRight_size vzw vzu vzx)) vzw vzx |
The bindings of the following Let/Where expression
| mkBalBranch5 key elt fm_L fm_R (size_l + size_r < 2) |
| where |
| double_L | fm_l (Branch key_r elt_r vvu (Branch key_rl elt_rl vvv fm_rll fm_rlr) fm_rr) | = mkBranch 5 key_rl elt_rl (mkBranch 6 key elt fm_l fm_rll) (mkBranch 7 key_r elt_r fm_rlr fm_rr) |
|
|
| double_R | (Branch key_l elt_l vuy fm_ll (Branch key_lr elt_lr vuz fm_lrl fm_lrr)) fm_r | = mkBranch 10 key_lr elt_lr (mkBranch 11 key_l elt_l fm_ll fm_lrl) (mkBranch 12 key elt fm_lrr fm_r) |
|
|
| mkBalBranch0 | fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = mkBalBranch02 fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) |
|
|
| mkBalBranch00 | fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = double_L fm_L fm_R |
|
|
| mkBalBranch01 | fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = single_L fm_L fm_R |
| mkBalBranch01 | fm_L fm_R vvw vvx vvy fm_rl fm_rr False | = mkBalBranch00 fm_L fm_R vvw vvx vvy fm_rl fm_rr otherwise |
|
|
| mkBalBranch02 | fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = mkBalBranch01 fm_L fm_R vvw vvx vvy fm_rl fm_rr (sizeFM fm_rl < 2 * sizeFM fm_rr) |
|
|
| mkBalBranch1 | fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = mkBalBranch12 fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) |
|
|
| mkBalBranch10 | fm_L fm_R vuv vuw vux fm_ll fm_lr True | = double_R fm_L fm_R |
|
|
| mkBalBranch11 | fm_L fm_R vuv vuw vux fm_ll fm_lr True | = single_R fm_L fm_R |
| mkBalBranch11 | fm_L fm_R vuv vuw vux fm_ll fm_lr False | = mkBalBranch10 fm_L fm_R vuv vuw vux fm_ll fm_lr otherwise |
|
|
| mkBalBranch12 | fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = mkBalBranch11 fm_L fm_R vuv vuw vux fm_ll fm_lr (sizeFM fm_lr < 2 * sizeFM fm_ll) |
|
|
| mkBalBranch2 | key elt fm_L fm_R True | = mkBranch 2 key elt fm_L fm_R |
|
|
| mkBalBranch3 | key elt fm_L fm_R True | = mkBalBranch1 fm_L fm_R fm_L |
| mkBalBranch3 | key elt fm_L fm_R False | = mkBalBranch2 key elt fm_L fm_R otherwise |
|
|
| mkBalBranch4 | key elt fm_L fm_R True | = mkBalBranch0 fm_L fm_R fm_R |
| mkBalBranch4 | key elt fm_L fm_R False | = mkBalBranch3 key elt fm_L fm_R (size_l > sIZE_RATIO * size_r) |
|
|
| mkBalBranch5 | key elt fm_L fm_R True | = mkBranch 1 key elt fm_L fm_R |
| mkBalBranch5 | key elt fm_L fm_R False | = mkBalBranch4 key elt fm_L fm_R (size_r > sIZE_RATIO * size_l) |
|
|
| single_L | fm_l (Branch key_r elt_r vvz fm_rl fm_rr) | = mkBranch 3 key_r elt_r (mkBranch 4 key elt fm_l fm_rl) fm_rr |
|
|
| single_R | (Branch key_l elt_l vuu fm_ll fm_lr) fm_r | = mkBranch 8 key_l elt_l fm_ll (mkBranch 9 key elt fm_lr fm_r) |
|
| |
| |
are unpacked to the following functions on top level
| mkBalBranch6MkBalBranch02 | vzy vzz wuu wuv fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = mkBalBranch6MkBalBranch01 vzy vzz wuu wuv fm_L fm_R vvw vvx vvy fm_rl fm_rr (sizeFM fm_rl < 2 * sizeFM fm_rr) |
| mkBalBranch6MkBalBranch5 | vzy vzz wuu wuv key elt fm_L fm_R True | = mkBranch 1 key elt fm_L fm_R |
| mkBalBranch6MkBalBranch5 | vzy vzz wuu wuv key elt fm_L fm_R False | = mkBalBranch6MkBalBranch4 vzy vzz wuu wuv key elt fm_L fm_R (mkBalBranch6Size_r vzy vzz wuu wuv > sIZE_RATIO * mkBalBranch6Size_l vzy vzz wuu wuv) |
| mkBalBranch6Double_L | vzy vzz wuu wuv fm_l (Branch key_r elt_r vvu (Branch key_rl elt_rl vvv fm_rll fm_rlr) fm_rr) | = mkBranch 5 key_rl elt_rl (mkBranch 6 vzy vzz fm_l fm_rll) (mkBranch 7 key_r elt_r fm_rlr fm_rr) |
| mkBalBranch6MkBalBranch4 | vzy vzz wuu wuv key elt fm_L fm_R True | = mkBalBranch6MkBalBranch0 vzy vzz wuu wuv fm_L fm_R fm_R |
| mkBalBranch6MkBalBranch4 | vzy vzz wuu wuv key elt fm_L fm_R False | = mkBalBranch6MkBalBranch3 vzy vzz wuu wuv key elt fm_L fm_R (mkBalBranch6Size_l vzy vzz wuu wuv > sIZE_RATIO * mkBalBranch6Size_r vzy vzz wuu wuv) |
| mkBalBranch6MkBalBranch12 | vzy vzz wuu wuv fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = mkBalBranch6MkBalBranch11 vzy vzz wuu wuv fm_L fm_R vuv vuw vux fm_ll fm_lr (sizeFM fm_lr < 2 * sizeFM fm_ll) |
| mkBalBranch6Double_R | vzy vzz wuu wuv (Branch key_l elt_l vuy fm_ll (Branch key_lr elt_lr vuz fm_lrl fm_lrr)) fm_r | = mkBranch 10 key_lr elt_lr (mkBranch 11 key_l elt_l fm_ll fm_lrl) (mkBranch 12 vzy vzz fm_lrr fm_r) |
| mkBalBranch6Single_L | vzy vzz wuu wuv fm_l (Branch key_r elt_r vvz fm_rl fm_rr) | = mkBranch 3 key_r elt_r (mkBranch 4 vzy vzz fm_l fm_rl) fm_rr |
| mkBalBranch6MkBalBranch10 | vzy vzz wuu wuv fm_L fm_R vuv vuw vux fm_ll fm_lr True | = mkBalBranch6Double_R vzy vzz wuu wuv fm_L fm_R |
| mkBalBranch6Single_R | vzy vzz wuu wuv (Branch key_l elt_l vuu fm_ll fm_lr) fm_r | = mkBranch 8 key_l elt_l fm_ll (mkBranch 9 vzy vzz fm_lr fm_r) |
| mkBalBranch6MkBalBranch2 | vzy vzz wuu wuv key elt fm_L fm_R True | = mkBranch 2 key elt fm_L fm_R |
| mkBalBranch6MkBalBranch00 | vzy vzz wuu wuv fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = mkBalBranch6Double_L vzy vzz wuu wuv fm_L fm_R |
| mkBalBranch6MkBalBranch11 | vzy vzz wuu wuv fm_L fm_R vuv vuw vux fm_ll fm_lr True | = mkBalBranch6Single_R vzy vzz wuu wuv fm_L fm_R |
| mkBalBranch6MkBalBranch11 | vzy vzz wuu wuv fm_L fm_R vuv vuw vux fm_ll fm_lr False | = mkBalBranch6MkBalBranch10 vzy vzz wuu wuv fm_L fm_R vuv vuw vux fm_ll fm_lr otherwise |
| mkBalBranch6Size_r | vzy vzz wuu wuv | = sizeFM wuu |
| mkBalBranch6MkBalBranch0 | vzy vzz wuu wuv fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = mkBalBranch6MkBalBranch02 vzy vzz wuu wuv fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) |
| mkBalBranch6MkBalBranch1 | vzy vzz wuu wuv fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = mkBalBranch6MkBalBranch12 vzy vzz wuu wuv fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) |
| mkBalBranch6MkBalBranch01 | vzy vzz wuu wuv fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = mkBalBranch6Single_L vzy vzz wuu wuv fm_L fm_R |
| mkBalBranch6MkBalBranch01 | vzy vzz wuu wuv fm_L fm_R vvw vvx vvy fm_rl fm_rr False | = mkBalBranch6MkBalBranch00 vzy vzz wuu wuv fm_L fm_R vvw vvx vvy fm_rl fm_rr otherwise |
| mkBalBranch6MkBalBranch3 | vzy vzz wuu wuv key elt fm_L fm_R True | = mkBalBranch6MkBalBranch1 vzy vzz wuu wuv fm_L fm_R fm_L |
| mkBalBranch6MkBalBranch3 | vzy vzz wuu wuv key elt fm_L fm_R False | = mkBalBranch6MkBalBranch2 vzy vzz wuu wuv key elt fm_L fm_R otherwise |
| mkBalBranch6Size_l | vzy vzz wuu wuv | = sizeFM wuv |
The bindings of the following Let/Where expression
| glueBal1 fm1 fm2 (sizeFM fm2 > sizeFM fm1) |
| where |
| glueBal0 | fm1 fm2 True | = mkBalBranch mid_key1 mid_elt1 (deleteMax fm1) fm2 |
|
|
| glueBal1 | fm1 fm2 True | = mkBalBranch mid_key2 mid_elt2 fm1 (deleteMin fm2) |
| glueBal1 | fm1 fm2 False | = glueBal0 fm1 fm2 otherwise |
|
| |
|
| mid_elt10 | (yu,mid_elt1) | = mid_elt1 |
|
| |
|
| mid_elt20 | (yv,mid_elt2) | = mid_elt2 |
|
| |
|
| mid_key10 | (mid_key1,yw) | = mid_key1 |
|
| |
|
| mid_key20 | (mid_key2,yx) | = mid_key2 |
|
| |
| |
are unpacked to the following functions on top level
| glueBal2Vv3 | wuw wux | = findMin wuw |
| glueBal2Mid_elt20 | wuw wux (yv,mid_elt2) | = mid_elt2 |
| glueBal2GlueBal1 | wuw wux fm1 fm2 True | = mkBalBranch (glueBal2Mid_key2 wuw wux) (glueBal2Mid_elt2 wuw wux) fm1 (deleteMin fm2) |
| glueBal2GlueBal1 | wuw wux fm1 fm2 False | = glueBal2GlueBal0 wuw wux fm1 fm2 otherwise |
| glueBal2Mid_key10 | wuw wux (mid_key1,yw) | = mid_key1 |
| glueBal2Mid_key2 | wuw wux | = glueBal2Mid_key20 wuw wux (glueBal2Vv3 wuw wux) |
| glueBal2Mid_elt10 | wuw wux (yu,mid_elt1) | = mid_elt1 |
| glueBal2Mid_key1 | wuw wux | = glueBal2Mid_key10 wuw wux (glueBal2Vv2 wuw wux) |
| glueBal2Mid_key20 | wuw wux (mid_key2,yx) | = mid_key2 |
| glueBal2Mid_elt1 | wuw wux | = glueBal2Mid_elt10 wuw wux (glueBal2Vv2 wuw wux) |
| glueBal2Vv2 | wuw wux | = findMax wux |
| glueBal2GlueBal0 | wuw wux fm1 fm2 True | = mkBalBranch (glueBal2Mid_key1 wuw wux) (glueBal2Mid_elt1 wuw wux) (deleteMax fm1) fm2 |
| glueBal2Mid_elt2 | wuw wux | = glueBal2Mid_elt20 wuw wux (glueBal2Vv3 wuw wux) |
The bindings of the following Let/Where expression
| let |
| biggest_left_key | | = fst (findMax fm_l) |
|
in | biggest_left_key < key |
are unpacked to the following functions on top level
| mkBranchLeft_ok0Biggest_left_key | wuy | = fst (findMax wuy) |
The bindings of the following Let/Where expression
| let |
| smallest_right_key | | = fst (findMin fm_r) |
|
in | key < smallest_right_key |
are unpacked to the following functions on top level
| mkBranchRight_ok0Smallest_right_key | wuz | = fst (findMin wuz) |
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
mainModule FiniteMap
|
| ((delFromFM :: FiniteMap Bool a -> Bool -> FiniteMap Bool a) :: FiniteMap Bool a -> Bool -> FiniteMap Bool a) |
module FiniteMap where
| | import qualified Maybe
import qualified Prelude
|
| | data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b)
|
| | instance (Eq a, Eq b) => Eq (FiniteMap a b) where
|
| | delFromFM :: Ord a => FiniteMap a b -> a -> FiniteMap a b
| delFromFM | EmptyFM del_key | = | delFromFM4 EmptyFM del_key |
| delFromFM | (Branch key elt size fm_l fm_r) del_key | = | delFromFM3 (Branch key elt size fm_l fm_r) del_key |
|
| |
| delFromFM0 | key elt size fm_l fm_r del_key True | = | glueBal fm_l fm_r |
|
| |
| delFromFM1 | key elt size fm_l fm_r del_key True | = | mkBalBranch key elt (delFromFM fm_l del_key) fm_r |
| delFromFM1 | key elt size fm_l fm_r del_key False | = | delFromFM0 key elt size fm_l fm_r del_key (key == del_key) |
|
| |
| delFromFM2 | key elt size fm_l fm_r del_key True | = | mkBalBranch key elt fm_l (delFromFM fm_r del_key) |
| delFromFM2 | key elt size fm_l fm_r del_key False | = | delFromFM1 key elt size fm_l fm_r del_key (del_key < key) |
|
| |
| delFromFM3 | (Branch key elt size fm_l fm_r) del_key | = | delFromFM2 key elt size fm_l fm_r del_key (del_key > key) |
|
| |
| delFromFM4 | EmptyFM del_key | = | emptyFM |
| delFromFM4 | vxz vyu | = | delFromFM3 vxz vyu |
|
| | deleteMax :: Ord b => FiniteMap b a -> FiniteMap b a
| deleteMax | (Branch key elt zy fm_l EmptyFM) | = | fm_l |
| deleteMax | (Branch key elt zz fm_l fm_r) | = | mkBalBranch key elt fm_l (deleteMax fm_r) |
|
| | deleteMin :: Ord b => FiniteMap b a -> FiniteMap b a
| deleteMin | (Branch key elt yy EmptyFM fm_r) | = | fm_r |
| deleteMin | (Branch key elt yz fm_l fm_r) | = | mkBalBranch key elt (deleteMin fm_l) fm_r |
|
| | emptyFM :: FiniteMap b a
|
| | findMax :: FiniteMap a b -> (a,b)
| findMax | (Branch key elt xw xx EmptyFM) | = | (key,elt) |
| findMax | (Branch key elt xy xz fm_r) | = | findMax fm_r |
|
| | findMin :: FiniteMap b a -> (b,a)
| findMin | (Branch key elt wy EmptyFM wz) | = | (key,elt) |
| findMin | (Branch key elt xu fm_l xv) | = | findMin fm_l |
|
| | glueBal :: Ord a => FiniteMap a b -> FiniteMap a b -> FiniteMap a b
| glueBal | EmptyFM fm2 | = | glueBal4 EmptyFM fm2 |
| glueBal | fm1 EmptyFM | = | glueBal3 fm1 EmptyFM |
| glueBal | fm1 fm2 | = | glueBal2 fm1 fm2 |
|
| |
| glueBal2 | fm1 fm2 | = | glueBal2GlueBal1 fm2 fm1 fm1 fm2 (sizeFM fm2 > sizeFM fm1) |
|
| |
| glueBal2GlueBal0 | wuw wux fm1 fm2 True | = | mkBalBranch (glueBal2Mid_key1 wuw wux) (glueBal2Mid_elt1 wuw wux) (deleteMax fm1) fm2 |
|
| |
| glueBal2GlueBal1 | wuw wux fm1 fm2 True | = | mkBalBranch (glueBal2Mid_key2 wuw wux) (glueBal2Mid_elt2 wuw wux) fm1 (deleteMin fm2) |
| glueBal2GlueBal1 | wuw wux fm1 fm2 False | = | glueBal2GlueBal0 wuw wux fm1 fm2 otherwise |
|
| |
| glueBal2Mid_elt1 | wuw wux | = | glueBal2Mid_elt10 wuw wux (glueBal2Vv2 wuw wux) |
|
| |
| glueBal2Mid_elt10 | wuw wux (yu,mid_elt1) | = | mid_elt1 |
|
| |
| glueBal2Mid_elt2 | wuw wux | = | glueBal2Mid_elt20 wuw wux (glueBal2Vv3 wuw wux) |
|
| |
| glueBal2Mid_elt20 | wuw wux (yv,mid_elt2) | = | mid_elt2 |
|
| |
| glueBal2Mid_key1 | wuw wux | = | glueBal2Mid_key10 wuw wux (glueBal2Vv2 wuw wux) |
|
| |
| glueBal2Mid_key10 | wuw wux (mid_key1,yw) | = | mid_key1 |
|
| |
| glueBal2Mid_key2 | wuw wux | = | glueBal2Mid_key20 wuw wux (glueBal2Vv3 wuw wux) |
|
| |
| glueBal2Mid_key20 | wuw wux (mid_key2,yx) | = | mid_key2 |
|
| |
| glueBal2Vv2 | wuw wux | = | findMax wux |
|
| |
| glueBal2Vv3 | wuw wux | = | findMin wuw |
|
| |
| glueBal3 | fm1 EmptyFM | = | fm1 |
| glueBal3 | vwy vwz | = | glueBal2 vwy vwz |
|
| |
| glueBal4 | EmptyFM fm2 | = | fm2 |
| glueBal4 | vxv vxw | = | glueBal3 vxv vxw |
|
| | mkBalBranch :: Ord a => a -> b -> FiniteMap a b -> FiniteMap a b -> FiniteMap a b
| mkBalBranch | key elt fm_L fm_R | = | mkBalBranch6 key elt fm_L fm_R |
|
| |
| mkBalBranch6 | key elt fm_L fm_R | = | mkBalBranch6MkBalBranch5 key elt fm_R fm_L key elt fm_L fm_R (mkBalBranch6Size_l key elt fm_R fm_L + mkBalBranch6Size_r key elt fm_R fm_L < 2) |
|
| |
| mkBalBranch6Double_L | vzy vzz wuu wuv fm_l (Branch key_r elt_r vvu (Branch key_rl elt_rl vvv fm_rll fm_rlr) fm_rr) | = | mkBranch 5 key_rl elt_rl (mkBranch 6 vzy vzz fm_l fm_rll) (mkBranch 7 key_r elt_r fm_rlr fm_rr) |
|
| |
| mkBalBranch6Double_R | vzy vzz wuu wuv (Branch key_l elt_l vuy fm_ll (Branch key_lr elt_lr vuz fm_lrl fm_lrr)) fm_r | = | mkBranch 10 key_lr elt_lr (mkBranch 11 key_l elt_l fm_ll fm_lrl) (mkBranch 12 vzy vzz fm_lrr fm_r) |
|
| |
| mkBalBranch6MkBalBranch0 | vzy vzz wuu wuv fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = | mkBalBranch6MkBalBranch02 vzy vzz wuu wuv fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) |
|
| |
| mkBalBranch6MkBalBranch00 | vzy vzz wuu wuv fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = | mkBalBranch6Double_L vzy vzz wuu wuv fm_L fm_R |
|
| |
| mkBalBranch6MkBalBranch01 | vzy vzz wuu wuv fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = | mkBalBranch6Single_L vzy vzz wuu wuv fm_L fm_R |
| mkBalBranch6MkBalBranch01 | vzy vzz wuu wuv fm_L fm_R vvw vvx vvy fm_rl fm_rr False | = | mkBalBranch6MkBalBranch00 vzy vzz wuu wuv fm_L fm_R vvw vvx vvy fm_rl fm_rr otherwise |
|
| |
| mkBalBranch6MkBalBranch02 | vzy vzz wuu wuv fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = | mkBalBranch6MkBalBranch01 vzy vzz wuu wuv fm_L fm_R vvw vvx vvy fm_rl fm_rr (sizeFM fm_rl < 2 * sizeFM fm_rr) |
|
| |
| mkBalBranch6MkBalBranch1 | vzy vzz wuu wuv fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = | mkBalBranch6MkBalBranch12 vzy vzz wuu wuv fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) |
|
| |
| mkBalBranch6MkBalBranch10 | vzy vzz wuu wuv fm_L fm_R vuv vuw vux fm_ll fm_lr True | = | mkBalBranch6Double_R vzy vzz wuu wuv fm_L fm_R |
|
| |
| mkBalBranch6MkBalBranch11 | vzy vzz wuu wuv fm_L fm_R vuv vuw vux fm_ll fm_lr True | = | mkBalBranch6Single_R vzy vzz wuu wuv fm_L fm_R |
| mkBalBranch6MkBalBranch11 | vzy vzz wuu wuv fm_L fm_R vuv vuw vux fm_ll fm_lr False | = | mkBalBranch6MkBalBranch10 vzy vzz wuu wuv fm_L fm_R vuv vuw vux fm_ll fm_lr otherwise |
|
| |
| mkBalBranch6MkBalBranch12 | vzy vzz wuu wuv fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = | mkBalBranch6MkBalBranch11 vzy vzz wuu wuv fm_L fm_R vuv vuw vux fm_ll fm_lr (sizeFM fm_lr < 2 * sizeFM fm_ll) |
|
| |
| mkBalBranch6MkBalBranch2 | vzy vzz wuu wuv key elt fm_L fm_R True | = | mkBranch 2 key elt fm_L fm_R |
|
| |
| mkBalBranch6MkBalBranch3 | vzy vzz wuu wuv key elt fm_L fm_R True | = | mkBalBranch6MkBalBranch1 vzy vzz wuu wuv fm_L fm_R fm_L |
| mkBalBranch6MkBalBranch3 | vzy vzz wuu wuv key elt fm_L fm_R False | = | mkBalBranch6MkBalBranch2 vzy vzz wuu wuv key elt fm_L fm_R otherwise |
|
| |
| mkBalBranch6MkBalBranch4 | vzy vzz wuu wuv key elt fm_L fm_R True | = | mkBalBranch6MkBalBranch0 vzy vzz wuu wuv fm_L fm_R fm_R |
| mkBalBranch6MkBalBranch4 | vzy vzz wuu wuv key elt fm_L fm_R False | = | mkBalBranch6MkBalBranch3 vzy vzz wuu wuv key elt fm_L fm_R (mkBalBranch6Size_l vzy vzz wuu wuv > sIZE_RATIO * mkBalBranch6Size_r vzy vzz wuu wuv) |
|
| |
| mkBalBranch6MkBalBranch5 | vzy vzz wuu wuv key elt fm_L fm_R True | = | mkBranch 1 key elt fm_L fm_R |
| mkBalBranch6MkBalBranch5 | vzy vzz wuu wuv key elt fm_L fm_R False | = | mkBalBranch6MkBalBranch4 vzy vzz wuu wuv key elt fm_L fm_R (mkBalBranch6Size_r vzy vzz wuu wuv > sIZE_RATIO * mkBalBranch6Size_l vzy vzz wuu wuv) |
|
| |
| mkBalBranch6Single_L | vzy vzz wuu wuv fm_l (Branch key_r elt_r vvz fm_rl fm_rr) | = | mkBranch 3 key_r elt_r (mkBranch 4 vzy vzz fm_l fm_rl) fm_rr |
|
| |
| mkBalBranch6Single_R | vzy vzz wuu wuv (Branch key_l elt_l vuu fm_ll fm_lr) fm_r | = | mkBranch 8 key_l elt_l fm_ll (mkBranch 9 vzy vzz fm_lr fm_r) |
|
| |
| mkBalBranch6Size_l | vzy vzz wuu wuv | = | sizeFM wuv |
|
| |
| mkBalBranch6Size_r | vzy vzz wuu wuv | = | sizeFM wuu |
|
| | mkBranch :: Ord b => Int -> b -> a -> FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| mkBranch | which key elt fm_l fm_r | = | mkBranchResult key elt fm_l fm_r |
|
| |
| mkBranchBalance_ok | vyx vyy vyz | = | True |
|
| |
| mkBranchLeft_ok | vyx vyy vyz | = | mkBranchLeft_ok0 vyx vyy vyz vyx vyy vyx |
|
| |
| mkBranchLeft_ok0 | vyx vyy vyz fm_l key EmptyFM | = | True |
| mkBranchLeft_ok0 | vyx vyy vyz fm_l key (Branch left_key wu wv ww wx) | = | mkBranchLeft_ok0Biggest_left_key fm_l < key |
|
| |
| mkBranchLeft_ok0Biggest_left_key | wuy | = | fst (findMax wuy) |
|
| |
| mkBranchLeft_size | vyx vyy vyz | = | sizeFM vyx |
|
| |
| mkBranchResult | vzu vzv vzw vzx | = | Branch vzu vzv (mkBranchUnbox vzw vzu vzx (1 + mkBranchLeft_size vzw vzu vzx + mkBranchRight_size vzw vzu vzx)) vzw vzx |
|
| |
| mkBranchRight_ok | vyx vyy vyz | = | mkBranchRight_ok0 vyx vyy vyz vyz vyy vyz |
|
| |
| mkBranchRight_ok0 | vyx vyy vyz fm_r key EmptyFM | = | True |
| mkBranchRight_ok0 | vyx vyy vyz fm_r key (Branch right_key vw vx vy vz) | = | key < mkBranchRight_ok0Smallest_right_key fm_r |
|
| |
| mkBranchRight_ok0Smallest_right_key | wuz | = | fst (findMin wuz) |
|
| |
| mkBranchRight_size | vyx vyy vyz | = | sizeFM vyz |
|
| | mkBranchUnbox :: Ord a => -> (FiniteMap a b) ( -> a ( -> (FiniteMap a b) (Int -> Int)))
| mkBranchUnbox | vyx vyy vyz x | = | x |
|
| | sIZE_RATIO :: Int
|
| | sizeFM :: FiniteMap a b -> Int
| sizeFM | EmptyFM | = | 0 |
| sizeFM | (Branch zu zv size zw zx) | = | size |
|
module Maybe where
| | import qualified FiniteMap
import qualified Prelude
|
Num Reduction: All numbers are transformed to thier corresponding representation with Pos, Neg, Succ and Zero.
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
mainModule FiniteMap
|
| (delFromFM :: FiniteMap Bool a -> Bool -> FiniteMap Bool a) |
module FiniteMap where
| | import qualified Maybe
import qualified Prelude
|
| | data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a)
|
| | instance (Eq a, Eq b) => Eq (FiniteMap a b) where
|
| | delFromFM :: Ord a => FiniteMap a b -> a -> FiniteMap a b
| delFromFM | EmptyFM del_key | = | delFromFM4 EmptyFM del_key |
| delFromFM | (Branch key elt size fm_l fm_r) del_key | = | delFromFM3 (Branch key elt size fm_l fm_r) del_key |
|
| |
| delFromFM0 | key elt size fm_l fm_r del_key True | = | glueBal fm_l fm_r |
|
| |
| delFromFM1 | key elt size fm_l fm_r del_key True | = | mkBalBranch key elt (delFromFM fm_l del_key) fm_r |
| delFromFM1 | key elt size fm_l fm_r del_key False | = | delFromFM0 key elt size fm_l fm_r del_key (key == del_key) |
|
| |
| delFromFM2 | key elt size fm_l fm_r del_key True | = | mkBalBranch key elt fm_l (delFromFM fm_r del_key) |
| delFromFM2 | key elt size fm_l fm_r del_key False | = | delFromFM1 key elt size fm_l fm_r del_key (del_key < key) |
|
| |
| delFromFM3 | (Branch key elt size fm_l fm_r) del_key | = | delFromFM2 key elt size fm_l fm_r del_key (del_key > key) |
|
| |
| delFromFM4 | EmptyFM del_key | = | emptyFM |
| delFromFM4 | vxz vyu | = | delFromFM3 vxz vyu |
|
| | deleteMax :: Ord b => FiniteMap b a -> FiniteMap b a
| deleteMax | (Branch key elt zy fm_l EmptyFM) | = | fm_l |
| deleteMax | (Branch key elt zz fm_l fm_r) | = | mkBalBranch key elt fm_l (deleteMax fm_r) |
|
| | deleteMin :: Ord a => FiniteMap a b -> FiniteMap a b
| deleteMin | (Branch key elt yy EmptyFM fm_r) | = | fm_r |
| deleteMin | (Branch key elt yz fm_l fm_r) | = | mkBalBranch key elt (deleteMin fm_l) fm_r |
|
| | emptyFM :: FiniteMap b a
|
| | findMax :: FiniteMap a b -> (a,b)
| findMax | (Branch key elt xw xx EmptyFM) | = | (key,elt) |
| findMax | (Branch key elt xy xz fm_r) | = | findMax fm_r |
|
| | findMin :: FiniteMap b a -> (b,a)
| findMin | (Branch key elt wy EmptyFM wz) | = | (key,elt) |
| findMin | (Branch key elt xu fm_l xv) | = | findMin fm_l |
|
| | glueBal :: Ord a => FiniteMap a b -> FiniteMap a b -> FiniteMap a b
| glueBal | EmptyFM fm2 | = | glueBal4 EmptyFM fm2 |
| glueBal | fm1 EmptyFM | = | glueBal3 fm1 EmptyFM |
| glueBal | fm1 fm2 | = | glueBal2 fm1 fm2 |
|
| |
| glueBal2 | fm1 fm2 | = | glueBal2GlueBal1 fm2 fm1 fm1 fm2 (sizeFM fm2 > sizeFM fm1) |
|
| |
| glueBal2GlueBal0 | wuw wux fm1 fm2 True | = | mkBalBranch (glueBal2Mid_key1 wuw wux) (glueBal2Mid_elt1 wuw wux) (deleteMax fm1) fm2 |
|
| |
| glueBal2GlueBal1 | wuw wux fm1 fm2 True | = | mkBalBranch (glueBal2Mid_key2 wuw wux) (glueBal2Mid_elt2 wuw wux) fm1 (deleteMin fm2) |
| glueBal2GlueBal1 | wuw wux fm1 fm2 False | = | glueBal2GlueBal0 wuw wux fm1 fm2 otherwise |
|
| |
| glueBal2Mid_elt1 | wuw wux | = | glueBal2Mid_elt10 wuw wux (glueBal2Vv2 wuw wux) |
|
| |
| glueBal2Mid_elt10 | wuw wux (yu,mid_elt1) | = | mid_elt1 |
|
| |
| glueBal2Mid_elt2 | wuw wux | = | glueBal2Mid_elt20 wuw wux (glueBal2Vv3 wuw wux) |
|
| |
| glueBal2Mid_elt20 | wuw wux (yv,mid_elt2) | = | mid_elt2 |
|
| |
| glueBal2Mid_key1 | wuw wux | = | glueBal2Mid_key10 wuw wux (glueBal2Vv2 wuw wux) |
|
| |
| glueBal2Mid_key10 | wuw wux (mid_key1,yw) | = | mid_key1 |
|
| |
| glueBal2Mid_key2 | wuw wux | = | glueBal2Mid_key20 wuw wux (glueBal2Vv3 wuw wux) |
|
| |
| glueBal2Mid_key20 | wuw wux (mid_key2,yx) | = | mid_key2 |
|
| |
| glueBal2Vv2 | wuw wux | = | findMax wux |
|
| |
| glueBal2Vv3 | wuw wux | = | findMin wuw |
|
| |
| glueBal3 | fm1 EmptyFM | = | fm1 |
| glueBal3 | vwy vwz | = | glueBal2 vwy vwz |
|
| |
| glueBal4 | EmptyFM fm2 | = | fm2 |
| glueBal4 | vxv vxw | = | glueBal3 vxv vxw |
|
| | mkBalBranch :: Ord b => b -> a -> FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| mkBalBranch | key elt fm_L fm_R | = | mkBalBranch6 key elt fm_L fm_R |
|
| |
| mkBalBranch6 | key elt fm_L fm_R | = | mkBalBranch6MkBalBranch5 key elt fm_R fm_L key elt fm_L fm_R (mkBalBranch6Size_l key elt fm_R fm_L + mkBalBranch6Size_r key elt fm_R fm_L < Pos (Succ (Succ Zero))) |
|
| |
| mkBalBranch6Double_L | vzy vzz wuu wuv fm_l (Branch key_r elt_r vvu (Branch key_rl elt_rl vvv fm_rll fm_rlr) fm_rr) | = | mkBranch (Pos (Succ (Succ (Succ (Succ (Succ Zero)))))) key_rl elt_rl (mkBranch (Pos (Succ (Succ (Succ (Succ (Succ (Succ Zero))))))) vzy vzz fm_l fm_rll) (mkBranch (Pos (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero)))))))) key_r elt_r fm_rlr fm_rr) |
|
| |
| mkBalBranch6Double_R | vzy vzz wuu wuv (Branch key_l elt_l vuy fm_ll (Branch key_lr elt_lr vuz fm_lrl fm_lrr)) fm_r | = | mkBranch (Pos (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero))))))))))) key_lr elt_lr (mkBranch (Pos (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero)))))))))))) key_l elt_l fm_ll fm_lrl) (mkBranch (Pos (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero))))))))))))) vzy vzz fm_lrr fm_r) |
|
| |
| mkBalBranch6MkBalBranch0 | vzy vzz wuu wuv fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = | mkBalBranch6MkBalBranch02 vzy vzz wuu wuv fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) |
|
| |
| mkBalBranch6MkBalBranch00 | vzy vzz wuu wuv fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = | mkBalBranch6Double_L vzy vzz wuu wuv fm_L fm_R |
|
| |
| mkBalBranch6MkBalBranch01 | vzy vzz wuu wuv fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = | mkBalBranch6Single_L vzy vzz wuu wuv fm_L fm_R |
| mkBalBranch6MkBalBranch01 | vzy vzz wuu wuv fm_L fm_R vvw vvx vvy fm_rl fm_rr False | = | mkBalBranch6MkBalBranch00 vzy vzz wuu wuv fm_L fm_R vvw vvx vvy fm_rl fm_rr otherwise |
|
| |
| mkBalBranch6MkBalBranch02 | vzy vzz wuu wuv fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = | mkBalBranch6MkBalBranch01 vzy vzz wuu wuv fm_L fm_R vvw vvx vvy fm_rl fm_rr (sizeFM fm_rl < Pos (Succ (Succ Zero)) * sizeFM fm_rr) |
|
| |
| mkBalBranch6MkBalBranch1 | vzy vzz wuu wuv fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = | mkBalBranch6MkBalBranch12 vzy vzz wuu wuv fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) |
|
| |
| mkBalBranch6MkBalBranch10 | vzy vzz wuu wuv fm_L fm_R vuv vuw vux fm_ll fm_lr True | = | mkBalBranch6Double_R vzy vzz wuu wuv fm_L fm_R |
|
| |
| mkBalBranch6MkBalBranch11 | vzy vzz wuu wuv fm_L fm_R vuv vuw vux fm_ll fm_lr True | = | mkBalBranch6Single_R vzy vzz wuu wuv fm_L fm_R |
| mkBalBranch6MkBalBranch11 | vzy vzz wuu wuv fm_L fm_R vuv vuw vux fm_ll fm_lr False | = | mkBalBranch6MkBalBranch10 vzy vzz wuu wuv fm_L fm_R vuv vuw vux fm_ll fm_lr otherwise |
|
| |
| mkBalBranch6MkBalBranch12 | vzy vzz wuu wuv fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = | mkBalBranch6MkBalBranch11 vzy vzz wuu wuv fm_L fm_R vuv vuw vux fm_ll fm_lr (sizeFM fm_lr < Pos (Succ (Succ Zero)) * sizeFM fm_ll) |
|
| |
| mkBalBranch6MkBalBranch2 | vzy vzz wuu wuv key elt fm_L fm_R True | = | mkBranch (Pos (Succ (Succ Zero))) key elt fm_L fm_R |
|
| |
| mkBalBranch6MkBalBranch3 | vzy vzz wuu wuv key elt fm_L fm_R True | = | mkBalBranch6MkBalBranch1 vzy vzz wuu wuv fm_L fm_R fm_L |
| mkBalBranch6MkBalBranch3 | vzy vzz wuu wuv key elt fm_L fm_R False | = | mkBalBranch6MkBalBranch2 vzy vzz wuu wuv key elt fm_L fm_R otherwise |
|
| |
| mkBalBranch6MkBalBranch4 | vzy vzz wuu wuv key elt fm_L fm_R True | = | mkBalBranch6MkBalBranch0 vzy vzz wuu wuv fm_L fm_R fm_R |
| mkBalBranch6MkBalBranch4 | vzy vzz wuu wuv key elt fm_L fm_R False | = | mkBalBranch6MkBalBranch3 vzy vzz wuu wuv key elt fm_L fm_R (mkBalBranch6Size_l vzy vzz wuu wuv > sIZE_RATIO * mkBalBranch6Size_r vzy vzz wuu wuv) |
|
| |
| mkBalBranch6MkBalBranch5 | vzy vzz wuu wuv key elt fm_L fm_R True | = | mkBranch (Pos (Succ Zero)) key elt fm_L fm_R |
| mkBalBranch6MkBalBranch5 | vzy vzz wuu wuv key elt fm_L fm_R False | = | mkBalBranch6MkBalBranch4 vzy vzz wuu wuv key elt fm_L fm_R (mkBalBranch6Size_r vzy vzz wuu wuv > sIZE_RATIO * mkBalBranch6Size_l vzy vzz wuu wuv) |
|
| |
| mkBalBranch6Single_L | vzy vzz wuu wuv fm_l (Branch key_r elt_r vvz fm_rl fm_rr) | = | mkBranch (Pos (Succ (Succ (Succ Zero)))) key_r elt_r (mkBranch (Pos (Succ (Succ (Succ (Succ Zero))))) vzy vzz fm_l fm_rl) fm_rr |
|
| |
| mkBalBranch6Single_R | vzy vzz wuu wuv (Branch key_l elt_l vuu fm_ll fm_lr) fm_r | = | mkBranch (Pos (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero))))))))) key_l elt_l fm_ll (mkBranch (Pos (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero)))))))))) vzy vzz fm_lr fm_r) |
|
| |
| mkBalBranch6Size_l | vzy vzz wuu wuv | = | sizeFM wuv |
|
| |
| mkBalBranch6Size_r | vzy vzz wuu wuv | = | sizeFM wuu |
|
| | mkBranch :: Ord b => Int -> b -> a -> FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| mkBranch | which key elt fm_l fm_r | = | mkBranchResult key elt fm_l fm_r |
|
| |
| mkBranchBalance_ok | vyx vyy vyz | = | True |
|
| |
| mkBranchLeft_ok | vyx vyy vyz | = | mkBranchLeft_ok0 vyx vyy vyz vyx vyy vyx |
|
| |
| mkBranchLeft_ok0 | vyx vyy vyz fm_l key EmptyFM | = | True |
| mkBranchLeft_ok0 | vyx vyy vyz fm_l key (Branch left_key wu wv ww wx) | = | mkBranchLeft_ok0Biggest_left_key fm_l < key |
|
| |
| mkBranchLeft_ok0Biggest_left_key | wuy | = | fst (findMax wuy) |
|
| |
| mkBranchLeft_size | vyx vyy vyz | = | sizeFM vyx |
|
| |
| mkBranchResult | vzu vzv vzw vzx | = | Branch vzu vzv (mkBranchUnbox vzw vzu vzx (Pos (Succ Zero) + mkBranchLeft_size vzw vzu vzx + mkBranchRight_size vzw vzu vzx)) vzw vzx |
|
| |
| mkBranchRight_ok | vyx vyy vyz | = | mkBranchRight_ok0 vyx vyy vyz vyz vyy vyz |
|
| |
| mkBranchRight_ok0 | vyx vyy vyz fm_r key EmptyFM | = | True |
| mkBranchRight_ok0 | vyx vyy vyz fm_r key (Branch right_key vw vx vy vz) | = | key < mkBranchRight_ok0Smallest_right_key fm_r |
|
| |
| mkBranchRight_ok0Smallest_right_key | wuz | = | fst (findMin wuz) |
|
| |
| mkBranchRight_size | vyx vyy vyz | = | sizeFM vyz |
|
| | mkBranchUnbox :: Ord a => -> (FiniteMap a b) ( -> a ( -> (FiniteMap a b) (Int -> Int)))
| mkBranchUnbox | vyx vyy vyz x | = | x |
|
| | sIZE_RATIO :: Int
| sIZE_RATIO | | = | Pos (Succ (Succ (Succ (Succ (Succ Zero))))) |
|
| | sizeFM :: FiniteMap b a -> Int
| sizeFM | EmptyFM | = | Pos Zero |
| sizeFM | (Branch zu zv size zw zx) | = | size |
|
module Maybe where
| | import qualified FiniteMap
import qualified Prelude
|
Haskell To QDPs
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key10(wvu2081, wvu2082, wvu2083, wvu2084, wvu2085, wvu2086, wvu2087, wvu2088, wvu2089, wvu2090, wvu2091, wvu2092, Branch(wvu20930, wvu20931, wvu20932, wvu20933, wvu20934), h, ba) → new_glueBal2Mid_key10(wvu2081, wvu2082, wvu2083, wvu2084, wvu2085, wvu2086, wvu2087, wvu2088, wvu20930, wvu20931, wvu20932, wvu20933, wvu20934, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key10(wvu2081, wvu2082, wvu2083, wvu2084, wvu2085, wvu2086, wvu2087, wvu2088, wvu2089, wvu2090, wvu2091, wvu2092, Branch(wvu20930, wvu20931, wvu20932, wvu20933, wvu20934), h, ba) → new_glueBal2Mid_key10(wvu2081, wvu2082, wvu2083, wvu2084, wvu2085, wvu2086, wvu2087, wvu2088, wvu20930, wvu20931, wvu20932, wvu20933, wvu20934, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 13 > 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 14 >= 14, 15 >= 15
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt10(wvu2067, wvu2068, wvu2069, wvu2070, wvu2071, wvu2072, wvu2073, wvu2074, wvu2075, wvu2076, wvu2077, wvu2078, Branch(wvu20790, wvu20791, wvu20792, wvu20793, wvu20794), h, ba) → new_glueBal2Mid_elt10(wvu2067, wvu2068, wvu2069, wvu2070, wvu2071, wvu2072, wvu2073, wvu2074, wvu20790, wvu20791, wvu20792, wvu20793, wvu20794, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt10(wvu2067, wvu2068, wvu2069, wvu2070, wvu2071, wvu2072, wvu2073, wvu2074, wvu2075, wvu2076, wvu2077, wvu2078, Branch(wvu20790, wvu20791, wvu20792, wvu20793, wvu20794), h, ba) → new_glueBal2Mid_elt10(wvu2067, wvu2068, wvu2069, wvu2070, wvu2071, wvu2072, wvu2073, wvu2074, wvu20790, wvu20791, wvu20792, wvu20793, wvu20794, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 13 > 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 14 >= 14, 15 >= 15
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key20(wvu2512, wvu2513, wvu2514, wvu2515, wvu2516, wvu2517, wvu2518, wvu2519, wvu2520, wvu2521, wvu2522, wvu2523, Branch(wvu25240, wvu25241, wvu25242, wvu25243, wvu25244), wvu2525, h, ba) → new_glueBal2Mid_key20(wvu2512, wvu2513, wvu2514, wvu2515, wvu2516, wvu2517, wvu2518, wvu2519, wvu2520, wvu25240, wvu25241, wvu25242, wvu25243, wvu25244, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key20(wvu2512, wvu2513, wvu2514, wvu2515, wvu2516, wvu2517, wvu2518, wvu2519, wvu2520, wvu2521, wvu2522, wvu2523, Branch(wvu25240, wvu25241, wvu25242, wvu25243, wvu25244), wvu2525, h, ba) → new_glueBal2Mid_key20(wvu2512, wvu2513, wvu2514, wvu2515, wvu2516, wvu2517, wvu2518, wvu2519, wvu2520, wvu25240, wvu25241, wvu25242, wvu25243, wvu25244, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 13 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt20(wvu2497, wvu2498, wvu2499, wvu2500, wvu2501, wvu2502, wvu2503, wvu2504, wvu2505, wvu2506, wvu2507, wvu2508, Branch(wvu25090, wvu25091, wvu25092, wvu25093, wvu25094), wvu2510, h, ba) → new_glueBal2Mid_elt20(wvu2497, wvu2498, wvu2499, wvu2500, wvu2501, wvu2502, wvu2503, wvu2504, wvu2505, wvu25090, wvu25091, wvu25092, wvu25093, wvu25094, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt20(wvu2497, wvu2498, wvu2499, wvu2500, wvu2501, wvu2502, wvu2503, wvu2504, wvu2505, wvu2506, wvu2507, wvu2508, Branch(wvu25090, wvu25091, wvu25092, wvu25093, wvu25094), wvu2510, h, ba) → new_glueBal2Mid_elt20(wvu2497, wvu2498, wvu2499, wvu2500, wvu2501, wvu2502, wvu2503, wvu2504, wvu2505, wvu25090, wvu25091, wvu25092, wvu25093, wvu25094, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 13 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key100(wvu2053, wvu2054, wvu2055, wvu2056, wvu2057, wvu2058, wvu2059, wvu2060, wvu2061, wvu2062, wvu2063, wvu2064, Branch(wvu20650, wvu20651, wvu20652, wvu20653, wvu20654), h, ba) → new_glueBal2Mid_key100(wvu2053, wvu2054, wvu2055, wvu2056, wvu2057, wvu2058, wvu2059, wvu2060, wvu20650, wvu20651, wvu20652, wvu20653, wvu20654, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key100(wvu2053, wvu2054, wvu2055, wvu2056, wvu2057, wvu2058, wvu2059, wvu2060, wvu2061, wvu2062, wvu2063, wvu2064, Branch(wvu20650, wvu20651, wvu20652, wvu20653, wvu20654), h, ba) → new_glueBal2Mid_key100(wvu2053, wvu2054, wvu2055, wvu2056, wvu2057, wvu2058, wvu2059, wvu2060, wvu20650, wvu20651, wvu20652, wvu20653, wvu20654, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 13 > 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 14 >= 14, 15 >= 15
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt100(wvu2039, wvu2040, wvu2041, wvu2042, wvu2043, wvu2044, wvu2045, wvu2046, wvu2047, wvu2048, wvu2049, wvu2050, Branch(wvu20510, wvu20511, wvu20512, wvu20513, wvu20514), h, ba) → new_glueBal2Mid_elt100(wvu2039, wvu2040, wvu2041, wvu2042, wvu2043, wvu2044, wvu2045, wvu2046, wvu20510, wvu20511, wvu20512, wvu20513, wvu20514, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt100(wvu2039, wvu2040, wvu2041, wvu2042, wvu2043, wvu2044, wvu2045, wvu2046, wvu2047, wvu2048, wvu2049, wvu2050, Branch(wvu20510, wvu20511, wvu20512, wvu20513, wvu20514), h, ba) → new_glueBal2Mid_elt100(wvu2039, wvu2040, wvu2041, wvu2042, wvu2043, wvu2044, wvu2045, wvu2046, wvu20510, wvu20511, wvu20512, wvu20513, wvu20514, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 13 > 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 14 >= 14, 15 >= 15
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key101(wvu2024, wvu2025, wvu2026, wvu2027, wvu2028, wvu2029, wvu2030, wvu2031, wvu2032, wvu2033, wvu2034, wvu2035, wvu2036, Branch(wvu20370, wvu20371, wvu20372, wvu20373, wvu20374), h, ba) → new_glueBal2Mid_key101(wvu2024, wvu2025, wvu2026, wvu2027, wvu2028, wvu2029, wvu2030, wvu2031, wvu2032, wvu20370, wvu20371, wvu20372, wvu20373, wvu20374, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key101(wvu2024, wvu2025, wvu2026, wvu2027, wvu2028, wvu2029, wvu2030, wvu2031, wvu2032, wvu2033, wvu2034, wvu2035, wvu2036, Branch(wvu20370, wvu20371, wvu20372, wvu20373, wvu20374), h, ba) → new_glueBal2Mid_key101(wvu2024, wvu2025, wvu2026, wvu2027, wvu2028, wvu2029, wvu2030, wvu2031, wvu2032, wvu20370, wvu20371, wvu20372, wvu20373, wvu20374, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 14 > 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt101(wvu2009, wvu2010, wvu2011, wvu2012, wvu2013, wvu2014, wvu2015, wvu2016, wvu2017, wvu2018, wvu2019, wvu2020, wvu2021, Branch(wvu20220, wvu20221, wvu20222, wvu20223, wvu20224), h, ba) → new_glueBal2Mid_elt101(wvu2009, wvu2010, wvu2011, wvu2012, wvu2013, wvu2014, wvu2015, wvu2016, wvu2017, wvu20220, wvu20221, wvu20222, wvu20223, wvu20224, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt101(wvu2009, wvu2010, wvu2011, wvu2012, wvu2013, wvu2014, wvu2015, wvu2016, wvu2017, wvu2018, wvu2019, wvu2020, wvu2021, Branch(wvu20220, wvu20221, wvu20222, wvu20223, wvu20224), h, ba) → new_glueBal2Mid_elt101(wvu2009, wvu2010, wvu2011, wvu2012, wvu2013, wvu2014, wvu2015, wvu2016, wvu2017, wvu20220, wvu20221, wvu20222, wvu20223, wvu20224, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 14 > 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt102(wvu2544, wvu2545, wvu2546, wvu2547, wvu2548, wvu2549, wvu2550, wvu2551, wvu2552, wvu2553, wvu2554, wvu2555, wvu2556, Branch(wvu25570, wvu25571, wvu25572, wvu25573, wvu25574), h, ba) → new_glueBal2Mid_elt102(wvu2544, wvu2545, wvu2546, wvu2547, wvu2548, wvu2549, wvu2550, wvu2551, wvu2552, wvu25570, wvu25571, wvu25572, wvu25573, wvu25574, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt102(wvu2544, wvu2545, wvu2546, wvu2547, wvu2548, wvu2549, wvu2550, wvu2551, wvu2552, wvu2553, wvu2554, wvu2555, wvu2556, Branch(wvu25570, wvu25571, wvu25572, wvu25573, wvu25574), h, ba) → new_glueBal2Mid_elt102(wvu2544, wvu2545, wvu2546, wvu2547, wvu2548, wvu2549, wvu2550, wvu2551, wvu2552, wvu25570, wvu25571, wvu25572, wvu25573, wvu25574, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 14 > 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key102(wvu2529, wvu2530, wvu2531, wvu2532, wvu2533, wvu2534, wvu2535, wvu2536, wvu2537, wvu2538, wvu2539, wvu2540, wvu2541, Branch(wvu25420, wvu25421, wvu25422, wvu25423, wvu25424), h, ba) → new_glueBal2Mid_key102(wvu2529, wvu2530, wvu2531, wvu2532, wvu2533, wvu2534, wvu2535, wvu2536, wvu2537, wvu25420, wvu25421, wvu25422, wvu25423, wvu25424, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key102(wvu2529, wvu2530, wvu2531, wvu2532, wvu2533, wvu2534, wvu2535, wvu2536, wvu2537, wvu2538, wvu2539, wvu2540, wvu2541, Branch(wvu25420, wvu25421, wvu25422, wvu25423, wvu25424), h, ba) → new_glueBal2Mid_key102(wvu2529, wvu2530, wvu2531, wvu2532, wvu2533, wvu2534, wvu2535, wvu2536, wvu2537, wvu25420, wvu25421, wvu25422, wvu25423, wvu25424, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 14 > 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt103(wvu2595, wvu2596, wvu2597, wvu2598, wvu2599, wvu2600, wvu2601, wvu2602, wvu2603, wvu2604, wvu2605, wvu2606, wvu2607, wvu2608, Branch(wvu26090, wvu26091, wvu26092, wvu26093, wvu26094), h, ba) → new_glueBal2Mid_elt103(wvu2595, wvu2596, wvu2597, wvu2598, wvu2599, wvu2600, wvu2601, wvu2602, wvu2603, wvu2604, wvu26090, wvu26091, wvu26092, wvu26093, wvu26094, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt103(wvu2595, wvu2596, wvu2597, wvu2598, wvu2599, wvu2600, wvu2601, wvu2602, wvu2603, wvu2604, wvu2605, wvu2606, wvu2607, wvu2608, Branch(wvu26090, wvu26091, wvu26092, wvu26093, wvu26094), h, ba) → new_glueBal2Mid_elt103(wvu2595, wvu2596, wvu2597, wvu2598, wvu2599, wvu2600, wvu2601, wvu2602, wvu2603, wvu2604, wvu26090, wvu26091, wvu26092, wvu26093, wvu26094, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 15 > 11, 15 > 12, 15 > 13, 15 > 14, 15 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key103(wvu2611, wvu2612, wvu2613, wvu2614, wvu2615, wvu2616, wvu2617, wvu2618, wvu2619, wvu2620, wvu2621, wvu2622, wvu2623, wvu2624, Branch(wvu26250, wvu26251, wvu26252, wvu26253, wvu26254), h, ba) → new_glueBal2Mid_key103(wvu2611, wvu2612, wvu2613, wvu2614, wvu2615, wvu2616, wvu2617, wvu2618, wvu2619, wvu2620, wvu26250, wvu26251, wvu26252, wvu26253, wvu26254, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key103(wvu2611, wvu2612, wvu2613, wvu2614, wvu2615, wvu2616, wvu2617, wvu2618, wvu2619, wvu2620, wvu2621, wvu2622, wvu2623, wvu2624, Branch(wvu26250, wvu26251, wvu26252, wvu26253, wvu26254), h, ba) → new_glueBal2Mid_key103(wvu2611, wvu2612, wvu2613, wvu2614, wvu2615, wvu2616, wvu2617, wvu2618, wvu2619, wvu2620, wvu26250, wvu26251, wvu26252, wvu26253, wvu26254, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 15 > 11, 15 > 12, 15 > 13, 15 > 14, 15 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key200(wvu2575, wvu2576, wvu2577, wvu2578, wvu2579, wvu2580, wvu2581, wvu2582, wvu2583, wvu2584, wvu2585, wvu2586, wvu2587, Branch(wvu25880, wvu25881, wvu25882, wvu25883, wvu25884), wvu2589, h, ba) → new_glueBal2Mid_key200(wvu2575, wvu2576, wvu2577, wvu2578, wvu2579, wvu2580, wvu2581, wvu2582, wvu2583, wvu2584, wvu25880, wvu25881, wvu25882, wvu25883, wvu25884, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key200(wvu2575, wvu2576, wvu2577, wvu2578, wvu2579, wvu2580, wvu2581, wvu2582, wvu2583, wvu2584, wvu2585, wvu2586, wvu2587, Branch(wvu25880, wvu25881, wvu25882, wvu25883, wvu25884), wvu2589, h, ba) → new_glueBal2Mid_key200(wvu2575, wvu2576, wvu2577, wvu2578, wvu2579, wvu2580, wvu2581, wvu2582, wvu2583, wvu2584, wvu25880, wvu25881, wvu25882, wvu25883, wvu25884, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 14 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt200(wvu2559, wvu2560, wvu2561, wvu2562, wvu2563, wvu2564, wvu2565, wvu2566, wvu2567, wvu2568, wvu2569, wvu2570, wvu2571, Branch(wvu25720, wvu25721, wvu25722, wvu25723, wvu25724), wvu2573, h, ba) → new_glueBal2Mid_elt200(wvu2559, wvu2560, wvu2561, wvu2562, wvu2563, wvu2564, wvu2565, wvu2566, wvu2567, wvu2568, wvu25720, wvu25721, wvu25722, wvu25723, wvu25724, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt200(wvu2559, wvu2560, wvu2561, wvu2562, wvu2563, wvu2564, wvu2565, wvu2566, wvu2567, wvu2568, wvu2569, wvu2570, wvu2571, Branch(wvu25720, wvu25721, wvu25722, wvu25723, wvu25724), wvu2573, h, ba) → new_glueBal2Mid_elt200(wvu2559, wvu2560, wvu2561, wvu2562, wvu2563, wvu2564, wvu2565, wvu2566, wvu2567, wvu2568, wvu25720, wvu25721, wvu25722, wvu25723, wvu25724, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 14 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt104(wvu2481, wvu2482, wvu2483, wvu2484, wvu2485, wvu2486, wvu2487, wvu2488, wvu2489, wvu2490, wvu2491, wvu2492, wvu2493, wvu2494, Branch(wvu24950, wvu24951, wvu24952, wvu24953, wvu24954), h, ba) → new_glueBal2Mid_elt104(wvu2481, wvu2482, wvu2483, wvu2484, wvu2485, wvu2486, wvu2487, wvu2488, wvu2489, wvu2490, wvu24950, wvu24951, wvu24952, wvu24953, wvu24954, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt104(wvu2481, wvu2482, wvu2483, wvu2484, wvu2485, wvu2486, wvu2487, wvu2488, wvu2489, wvu2490, wvu2491, wvu2492, wvu2493, wvu2494, Branch(wvu24950, wvu24951, wvu24952, wvu24953, wvu24954), h, ba) → new_glueBal2Mid_elt104(wvu2481, wvu2482, wvu2483, wvu2484, wvu2485, wvu2486, wvu2487, wvu2488, wvu2489, wvu2490, wvu24950, wvu24951, wvu24952, wvu24953, wvu24954, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 15 > 11, 15 > 12, 15 > 13, 15 > 14, 15 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key104(wvu2465, wvu2466, wvu2467, wvu2468, wvu2469, wvu2470, wvu2471, wvu2472, wvu2473, wvu2474, wvu2475, wvu2476, wvu2477, wvu2478, Branch(wvu24790, wvu24791, wvu24792, wvu24793, wvu24794), h, ba) → new_glueBal2Mid_key104(wvu2465, wvu2466, wvu2467, wvu2468, wvu2469, wvu2470, wvu2471, wvu2472, wvu2473, wvu2474, wvu24790, wvu24791, wvu24792, wvu24793, wvu24794, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key104(wvu2465, wvu2466, wvu2467, wvu2468, wvu2469, wvu2470, wvu2471, wvu2472, wvu2473, wvu2474, wvu2475, wvu2476, wvu2477, wvu2478, Branch(wvu24790, wvu24791, wvu24792, wvu24793, wvu24794), h, ba) → new_glueBal2Mid_key104(wvu2465, wvu2466, wvu2467, wvu2468, wvu2469, wvu2470, wvu2471, wvu2472, wvu2473, wvu2474, wvu24790, wvu24791, wvu24792, wvu24793, wvu24794, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 15 > 11, 15 > 12, 15 > 13, 15 > 14, 15 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key105(wvu1995, wvu1996, wvu1997, wvu1998, wvu1999, wvu2000, wvu2001, wvu2002, wvu2003, wvu2004, wvu2005, wvu2006, Branch(wvu20070, wvu20071, wvu20072, wvu20073, wvu20074), h, ba) → new_glueBal2Mid_key105(wvu1995, wvu1996, wvu1997, wvu1998, wvu1999, wvu2000, wvu2001, wvu2002, wvu20070, wvu20071, wvu20072, wvu20073, wvu20074, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key105(wvu1995, wvu1996, wvu1997, wvu1998, wvu1999, wvu2000, wvu2001, wvu2002, wvu2003, wvu2004, wvu2005, wvu2006, Branch(wvu20070, wvu20071, wvu20072, wvu20073, wvu20074), h, ba) → new_glueBal2Mid_key105(wvu1995, wvu1996, wvu1997, wvu1998, wvu1999, wvu2000, wvu2001, wvu2002, wvu20070, wvu20071, wvu20072, wvu20073, wvu20074, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 13 > 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 14 >= 14, 15 >= 15
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt105(wvu1981, wvu1982, wvu1983, wvu1984, wvu1985, wvu1986, wvu1987, wvu1988, wvu1989, wvu1990, wvu1991, wvu1992, Branch(wvu19930, wvu19931, wvu19932, wvu19933, wvu19934), h, ba) → new_glueBal2Mid_elt105(wvu1981, wvu1982, wvu1983, wvu1984, wvu1985, wvu1986, wvu1987, wvu1988, wvu19930, wvu19931, wvu19932, wvu19933, wvu19934, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt105(wvu1981, wvu1982, wvu1983, wvu1984, wvu1985, wvu1986, wvu1987, wvu1988, wvu1989, wvu1990, wvu1991, wvu1992, Branch(wvu19930, wvu19931, wvu19932, wvu19933, wvu19934), h, ba) → new_glueBal2Mid_elt105(wvu1981, wvu1982, wvu1983, wvu1984, wvu1985, wvu1986, wvu1987, wvu1988, wvu19930, wvu19931, wvu19932, wvu19933, wvu19934, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 13 > 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 14 >= 14, 15 >= 15
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key201(wvu2448, wvu2449, wvu2450, wvu2451, wvu2452, wvu2453, wvu2454, wvu2455, wvu2456, wvu2457, wvu2458, wvu2459, Branch(wvu24600, wvu24601, wvu24602, wvu24603, wvu24604), wvu2461, h, ba) → new_glueBal2Mid_key201(wvu2448, wvu2449, wvu2450, wvu2451, wvu2452, wvu2453, wvu2454, wvu2455, wvu2456, wvu24600, wvu24601, wvu24602, wvu24603, wvu24604, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key201(wvu2448, wvu2449, wvu2450, wvu2451, wvu2452, wvu2453, wvu2454, wvu2455, wvu2456, wvu2457, wvu2458, wvu2459, Branch(wvu24600, wvu24601, wvu24602, wvu24603, wvu24604), wvu2461, h, ba) → new_glueBal2Mid_key201(wvu2448, wvu2449, wvu2450, wvu2451, wvu2452, wvu2453, wvu2454, wvu2455, wvu2456, wvu24600, wvu24601, wvu24602, wvu24603, wvu24604, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 13 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt201(wvu2433, wvu2434, wvu2435, wvu2436, wvu2437, wvu2438, wvu2439, wvu2440, wvu2441, wvu2442, wvu2443, wvu2444, Branch(wvu24450, wvu24451, wvu24452, wvu24453, wvu24454), wvu2446, h, ba) → new_glueBal2Mid_elt201(wvu2433, wvu2434, wvu2435, wvu2436, wvu2437, wvu2438, wvu2439, wvu2440, wvu2441, wvu24450, wvu24451, wvu24452, wvu24453, wvu24454, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt201(wvu2433, wvu2434, wvu2435, wvu2436, wvu2437, wvu2438, wvu2439, wvu2440, wvu2441, wvu2442, wvu2443, wvu2444, Branch(wvu24450, wvu24451, wvu24452, wvu24453, wvu24454), wvu2446, h, ba) → new_glueBal2Mid_elt201(wvu2433, wvu2434, wvu2435, wvu2436, wvu2437, wvu2438, wvu2439, wvu2440, wvu2441, wvu24450, wvu24451, wvu24452, wvu24453, wvu24454, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 13 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key106(wvu1967, wvu1968, wvu1969, wvu1970, wvu1971, wvu1972, wvu1973, wvu1974, wvu1975, wvu1976, wvu1977, wvu1978, Branch(wvu19790, wvu19791, wvu19792, wvu19793, wvu19794), h, ba) → new_glueBal2Mid_key106(wvu1967, wvu1968, wvu1969, wvu1970, wvu1971, wvu1972, wvu1973, wvu1974, wvu19790, wvu19791, wvu19792, wvu19793, wvu19794, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key106(wvu1967, wvu1968, wvu1969, wvu1970, wvu1971, wvu1972, wvu1973, wvu1974, wvu1975, wvu1976, wvu1977, wvu1978, Branch(wvu19790, wvu19791, wvu19792, wvu19793, wvu19794), h, ba) → new_glueBal2Mid_key106(wvu1967, wvu1968, wvu1969, wvu1970, wvu1971, wvu1972, wvu1973, wvu1974, wvu19790, wvu19791, wvu19792, wvu19793, wvu19794, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 13 > 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 14 >= 14, 15 >= 15
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt106(wvu1953, wvu1954, wvu1955, wvu1956, wvu1957, wvu1958, wvu1959, wvu1960, wvu1961, wvu1962, wvu1963, wvu1964, Branch(wvu19650, wvu19651, wvu19652, wvu19653, wvu19654), h, ba) → new_glueBal2Mid_elt106(wvu1953, wvu1954, wvu1955, wvu1956, wvu1957, wvu1958, wvu1959, wvu1960, wvu19650, wvu19651, wvu19652, wvu19653, wvu19654, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt106(wvu1953, wvu1954, wvu1955, wvu1956, wvu1957, wvu1958, wvu1959, wvu1960, wvu1961, wvu1962, wvu1963, wvu1964, Branch(wvu19650, wvu19651, wvu19652, wvu19653, wvu19654), h, ba) → new_glueBal2Mid_elt106(wvu1953, wvu1954, wvu1955, wvu1956, wvu1957, wvu1958, wvu1959, wvu1960, wvu19650, wvu19651, wvu19652, wvu19653, wvu19654, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 13 > 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 14 >= 14, 15 >= 15
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key107(wvu2116, wvu2117, wvu2118, wvu2119, wvu2120, wvu2121, wvu2122, wvu2123, wvu2124, wvu2125, wvu2126, wvu2127, wvu2128, Branch(wvu21290, wvu21291, wvu21292, wvu21293, wvu21294), h, ba) → new_glueBal2Mid_key107(wvu2116, wvu2117, wvu2118, wvu2119, wvu2120, wvu2121, wvu2122, wvu2123, wvu2124, wvu21290, wvu21291, wvu21292, wvu21293, wvu21294, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key107(wvu2116, wvu2117, wvu2118, wvu2119, wvu2120, wvu2121, wvu2122, wvu2123, wvu2124, wvu2125, wvu2126, wvu2127, wvu2128, Branch(wvu21290, wvu21291, wvu21292, wvu21293, wvu21294), h, ba) → new_glueBal2Mid_key107(wvu2116, wvu2117, wvu2118, wvu2119, wvu2120, wvu2121, wvu2122, wvu2123, wvu2124, wvu21290, wvu21291, wvu21292, wvu21293, wvu21294, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 14 > 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt107(wvu2101, wvu2102, wvu2103, wvu2104, wvu2105, wvu2106, wvu2107, wvu2108, wvu2109, wvu2110, wvu2111, wvu2112, wvu2113, Branch(wvu21140, wvu21141, wvu21142, wvu21143, wvu21144), h, ba) → new_glueBal2Mid_elt107(wvu2101, wvu2102, wvu2103, wvu2104, wvu2105, wvu2106, wvu2107, wvu2108, wvu2109, wvu21140, wvu21141, wvu21142, wvu21143, wvu21144, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt107(wvu2101, wvu2102, wvu2103, wvu2104, wvu2105, wvu2106, wvu2107, wvu2108, wvu2109, wvu2110, wvu2111, wvu2112, wvu2113, Branch(wvu21140, wvu21141, wvu21142, wvu21143, wvu21144), h, ba) → new_glueBal2Mid_elt107(wvu2101, wvu2102, wvu2103, wvu2104, wvu2105, wvu2106, wvu2107, wvu2108, wvu2109, wvu21140, wvu21141, wvu21142, wvu21143, wvu21144, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 14 > 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key202(wvu1808, wvu1809, wvu1810, wvu1811, wvu1812, wvu1813, wvu1814, wvu1815, wvu1816, wvu1817, wvu1818, wvu1819, wvu1820, Branch(wvu18210, wvu18211, wvu18212, wvu18213, wvu18214), wvu1822, h, ba) → new_glueBal2Mid_key202(wvu1808, wvu1809, wvu1810, wvu1811, wvu1812, wvu1813, wvu1814, wvu1815, wvu1816, wvu1817, wvu18210, wvu18211, wvu18212, wvu18213, wvu18214, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key202(wvu1808, wvu1809, wvu1810, wvu1811, wvu1812, wvu1813, wvu1814, wvu1815, wvu1816, wvu1817, wvu1818, wvu1819, wvu1820, Branch(wvu18210, wvu18211, wvu18212, wvu18213, wvu18214), wvu1822, h, ba) → new_glueBal2Mid_key202(wvu1808, wvu1809, wvu1810, wvu1811, wvu1812, wvu1813, wvu1814, wvu1815, wvu1816, wvu1817, wvu18210, wvu18211, wvu18212, wvu18213, wvu18214, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 14 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt202(wvu1792, wvu1793, wvu1794, wvu1795, wvu1796, wvu1797, wvu1798, wvu1799, wvu1800, wvu1801, wvu1802, wvu1803, wvu1804, Branch(wvu18050, wvu18051, wvu18052, wvu18053, wvu18054), wvu1806, h, ba) → new_glueBal2Mid_elt202(wvu1792, wvu1793, wvu1794, wvu1795, wvu1796, wvu1797, wvu1798, wvu1799, wvu1800, wvu1801, wvu18050, wvu18051, wvu18052, wvu18053, wvu18054, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt202(wvu1792, wvu1793, wvu1794, wvu1795, wvu1796, wvu1797, wvu1798, wvu1799, wvu1800, wvu1801, wvu1802, wvu1803, wvu1804, Branch(wvu18050, wvu18051, wvu18052, wvu18053, wvu18054), wvu1806, h, ba) → new_glueBal2Mid_elt202(wvu1792, wvu1793, wvu1794, wvu1795, wvu1796, wvu1797, wvu1798, wvu1799, wvu1800, wvu1801, wvu18050, wvu18051, wvu18052, wvu18053, wvu18054, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 14 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key203(wvu1876, wvu1877, wvu1878, wvu1879, wvu1880, wvu1881, wvu1882, wvu1883, wvu1884, wvu1885, wvu1886, wvu1887, Branch(wvu18880, wvu18881, wvu18882, wvu18883, wvu18884), wvu1889, h, ba) → new_glueBal2Mid_key203(wvu1876, wvu1877, wvu1878, wvu1879, wvu1880, wvu1881, wvu1882, wvu1883, wvu1884, wvu18880, wvu18881, wvu18882, wvu18883, wvu18884, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key203(wvu1876, wvu1877, wvu1878, wvu1879, wvu1880, wvu1881, wvu1882, wvu1883, wvu1884, wvu1885, wvu1886, wvu1887, Branch(wvu18880, wvu18881, wvu18882, wvu18883, wvu18884), wvu1889, h, ba) → new_glueBal2Mid_key203(wvu1876, wvu1877, wvu1878, wvu1879, wvu1880, wvu1881, wvu1882, wvu1883, wvu1884, wvu18880, wvu18881, wvu18882, wvu18883, wvu18884, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 13 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt203(wvu1861, wvu1862, wvu1863, wvu1864, wvu1865, wvu1866, wvu1867, wvu1868, wvu1869, wvu1870, wvu1871, wvu1872, Branch(wvu18730, wvu18731, wvu18732, wvu18733, wvu18734), wvu1874, h, ba) → new_glueBal2Mid_elt203(wvu1861, wvu1862, wvu1863, wvu1864, wvu1865, wvu1866, wvu1867, wvu1868, wvu1869, wvu18730, wvu18731, wvu18732, wvu18733, wvu18734, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt203(wvu1861, wvu1862, wvu1863, wvu1864, wvu1865, wvu1866, wvu1867, wvu1868, wvu1869, wvu1870, wvu1871, wvu1872, Branch(wvu18730, wvu18731, wvu18732, wvu18733, wvu18734), wvu1874, h, ba) → new_glueBal2Mid_elt203(wvu1861, wvu1862, wvu1863, wvu1864, wvu1865, wvu1866, wvu1867, wvu1868, wvu1869, wvu18730, wvu18731, wvu18732, wvu18733, wvu18734, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 13 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key108(wvu2367, wvu2368, wvu2369, wvu2370, wvu2371, wvu2372, wvu2373, wvu2374, wvu2375, wvu2376, wvu2377, wvu2378, wvu2379, wvu2380, Branch(wvu23810, wvu23811, wvu23812, wvu23813, wvu23814), h, ba) → new_glueBal2Mid_key108(wvu2367, wvu2368, wvu2369, wvu2370, wvu2371, wvu2372, wvu2373, wvu2374, wvu2375, wvu2376, wvu23810, wvu23811, wvu23812, wvu23813, wvu23814, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key108(wvu2367, wvu2368, wvu2369, wvu2370, wvu2371, wvu2372, wvu2373, wvu2374, wvu2375, wvu2376, wvu2377, wvu2378, wvu2379, wvu2380, Branch(wvu23810, wvu23811, wvu23812, wvu23813, wvu23814), h, ba) → new_glueBal2Mid_key108(wvu2367, wvu2368, wvu2369, wvu2370, wvu2371, wvu2372, wvu2373, wvu2374, wvu2375, wvu2376, wvu23810, wvu23811, wvu23812, wvu23813, wvu23814, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 15 > 11, 15 > 12, 15 > 13, 15 > 14, 15 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt108(wvu2351, wvu2352, wvu2353, wvu2354, wvu2355, wvu2356, wvu2357, wvu2358, wvu2359, wvu2360, wvu2361, wvu2362, wvu2363, wvu2364, Branch(wvu23650, wvu23651, wvu23652, wvu23653, wvu23654), h, ba) → new_glueBal2Mid_elt108(wvu2351, wvu2352, wvu2353, wvu2354, wvu2355, wvu2356, wvu2357, wvu2358, wvu2359, wvu2360, wvu23650, wvu23651, wvu23652, wvu23653, wvu23654, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt108(wvu2351, wvu2352, wvu2353, wvu2354, wvu2355, wvu2356, wvu2357, wvu2358, wvu2359, wvu2360, wvu2361, wvu2362, wvu2363, wvu2364, Branch(wvu23650, wvu23651, wvu23652, wvu23653, wvu23654), h, ba) → new_glueBal2Mid_elt108(wvu2351, wvu2352, wvu2353, wvu2354, wvu2355, wvu2356, wvu2357, wvu2358, wvu2359, wvu2360, wvu23650, wvu23651, wvu23652, wvu23653, wvu23654, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 15 > 11, 15 > 12, 15 > 13, 15 > 14, 15 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key204(wvu2228, wvu2229, wvu2230, wvu2231, wvu2232, wvu2233, wvu2234, wvu2235, wvu2236, wvu2237, wvu2238, wvu2239, wvu2240, Branch(wvu22410, wvu22411, wvu22412, wvu22413, wvu22414), wvu2242, h, ba) → new_glueBal2Mid_key204(wvu2228, wvu2229, wvu2230, wvu2231, wvu2232, wvu2233, wvu2234, wvu2235, wvu2236, wvu2237, wvu22410, wvu22411, wvu22412, wvu22413, wvu22414, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key204(wvu2228, wvu2229, wvu2230, wvu2231, wvu2232, wvu2233, wvu2234, wvu2235, wvu2236, wvu2237, wvu2238, wvu2239, wvu2240, Branch(wvu22410, wvu22411, wvu22412, wvu22413, wvu22414), wvu2242, h, ba) → new_glueBal2Mid_key204(wvu2228, wvu2229, wvu2230, wvu2231, wvu2232, wvu2233, wvu2234, wvu2235, wvu2236, wvu2237, wvu22410, wvu22411, wvu22412, wvu22413, wvu22414, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 14 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt204(wvu2212, wvu2213, wvu2214, wvu2215, wvu2216, wvu2217, wvu2218, wvu2219, wvu2220, wvu2221, wvu2222, wvu2223, wvu2224, Branch(wvu22250, wvu22251, wvu22252, wvu22253, wvu22254), wvu2226, h, ba) → new_glueBal2Mid_elt204(wvu2212, wvu2213, wvu2214, wvu2215, wvu2216, wvu2217, wvu2218, wvu2219, wvu2220, wvu2221, wvu22250, wvu22251, wvu22252, wvu22253, wvu22254, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt204(wvu2212, wvu2213, wvu2214, wvu2215, wvu2216, wvu2217, wvu2218, wvu2219, wvu2220, wvu2221, wvu2222, wvu2223, wvu2224, Branch(wvu22250, wvu22251, wvu22252, wvu22253, wvu22254), wvu2226, h, ba) → new_glueBal2Mid_elt204(wvu2212, wvu2213, wvu2214, wvu2215, wvu2216, wvu2217, wvu2218, wvu2219, wvu2220, wvu2221, wvu22250, wvu22251, wvu22252, wvu22253, wvu22254, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 14 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_primMinusNat(Succ(wvu33200), Succ(wvu5200)) → new_primMinusNat(wvu33200, wvu5200)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_primMinusNat(Succ(wvu33200), Succ(wvu5200)) → new_primMinusNat(wvu33200, wvu5200)
The graph contains the following edges 1 > 1, 2 > 2
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_primPlusNat(Succ(wvu33200), Succ(wvu5200)) → new_primPlusNat(wvu33200, wvu5200)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_primPlusNat(Succ(wvu33200), Succ(wvu5200)) → new_primPlusNat(wvu33200, wvu5200)
The graph contains the following edges 1 > 1, 2 > 2
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch11(wvu2414, wvu2413, wvu2404, wvu2388, wvu2389, wvu2390, wvu2391, wvu2392, Succ(wvu2842000), Succ(wvu284400), h, ba) → new_mkBalBranch6MkBalBranch11(wvu2414, wvu2413, wvu2404, wvu2388, wvu2389, wvu2390, wvu2391, wvu2392, wvu2842000, wvu284400, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch11(wvu2414, wvu2413, wvu2404, wvu2388, wvu2389, wvu2390, wvu2391, wvu2392, Succ(wvu2842000), Succ(wvu284400), h, ba) → new_mkBalBranch6MkBalBranch11(wvu2414, wvu2413, wvu2404, wvu2388, wvu2389, wvu2390, wvu2391, wvu2392, wvu2842000, wvu284400, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 > 9, 10 > 10, 11 >= 11, 12 >= 12
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch3(wvu2414, wvu2413, wvu2404, wvu2388, wvu2389, wvu2390, wvu2391, wvu2392, wvu2412, wvu2411, Succ(wvu2676000), Succ(wvu278000), h, ba) → new_mkBalBranch6MkBalBranch3(wvu2414, wvu2413, wvu2404, wvu2388, wvu2389, wvu2390, wvu2391, wvu2392, wvu2412, wvu2411, wvu2676000, wvu278000, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch3(wvu2414, wvu2413, wvu2404, wvu2388, wvu2389, wvu2390, wvu2391, wvu2392, wvu2412, wvu2411, Succ(wvu2676000), Succ(wvu278000), h, ba) → new_mkBalBranch6MkBalBranch3(wvu2414, wvu2413, wvu2404, wvu2388, wvu2389, wvu2390, wvu2391, wvu2392, wvu2412, wvu2411, wvu2676000, wvu278000, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 11 > 11, 12 > 12, 13 >= 13, 14 >= 14
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch01(wvu2414, wvu2413, wvu24040, wvu24041, wvu24042, wvu24043, wvu24044, wvu2388, wvu2389, wvu2390, wvu2391, wvu2392, Succ(wvu2735000), Succ(wvu282600), h, ba) → new_mkBalBranch6MkBalBranch01(wvu2414, wvu2413, wvu24040, wvu24041, wvu24042, wvu24043, wvu24044, wvu2388, wvu2389, wvu2390, wvu2391, wvu2392, wvu2735000, wvu282600, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch01(wvu2414, wvu2413, wvu24040, wvu24041, wvu24042, wvu24043, wvu24044, wvu2388, wvu2389, wvu2390, wvu2391, wvu2392, Succ(wvu2735000), Succ(wvu282600), h, ba) → new_mkBalBranch6MkBalBranch01(wvu2414, wvu2413, wvu24040, wvu24041, wvu24042, wvu24043, wvu24044, wvu2388, wvu2389, wvu2390, wvu2391, wvu2392, wvu2735000, wvu282600, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 11 >= 11, 12 >= 12, 13 > 13, 14 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch4(wvu2414, wvu2413, wvu2404, wvu2388, wvu2389, wvu2390, wvu2391, wvu2392, wvu2412, wvu2411, Succ(wvu2527000), Succ(wvu262600), h, ba) → new_mkBalBranch6MkBalBranch4(wvu2414, wvu2413, wvu2404, wvu2388, wvu2389, wvu2390, wvu2391, wvu2392, wvu2412, wvu2411, wvu2527000, wvu262600, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch4(wvu2414, wvu2413, wvu2404, wvu2388, wvu2389, wvu2390, wvu2391, wvu2392, wvu2412, wvu2411, Succ(wvu2527000), Succ(wvu262600), h, ba) → new_mkBalBranch6MkBalBranch4(wvu2414, wvu2413, wvu2404, wvu2388, wvu2389, wvu2390, wvu2391, wvu2392, wvu2412, wvu2411, wvu2527000, wvu262600, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 11 > 11, 12 > 12, 13 >= 13, 14 >= 14
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch010(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1823000), Succ(wvu240600), h, ba) → new_mkBalBranch6MkBalBranch010(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu1823000, wvu240600, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch010(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1823000), Succ(wvu240600), h, ba) → new_mkBalBranch6MkBalBranch010(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu1823000, wvu240600, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 > 9, 10 > 10, 11 >= 11, 12 >= 12
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch110(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu2706000), Succ(wvu281800), h, ba) → new_mkBalBranch6MkBalBranch110(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu2706000, wvu281800, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch110(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu2706000), Succ(wvu281800), h, ba) → new_mkBalBranch6MkBalBranch110(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu2706000, wvu281800, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 11 >= 11, 12 >= 12, 13 > 13, 14 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch30(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1782000), Succ(wvu234200), h, ba) → new_mkBalBranch6MkBalBranch30(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu1782000, wvu234200, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch30(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1782000), Succ(wvu234200), h, ba) → new_mkBalBranch6MkBalBranch30(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu1782000, wvu234200, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 > 9, 10 > 10, 11 >= 11, 12 >= 12
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch011(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Succ(wvu2680000), Succ(wvu272700), h, ba) → new_mkBalBranch6MkBalBranch011(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, wvu2680000, wvu272700, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch011(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Succ(wvu2680000), Succ(wvu272700), h, ba) → new_mkBalBranch6MkBalBranch011(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, wvu2680000, wvu272700, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 > 10, 11 > 11, 12 >= 12, 13 >= 13
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch111(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu2682000), Succ(wvu277100), h, ba) → new_mkBalBranch6MkBalBranch111(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu2682000, wvu277100, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch111(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu2682000), Succ(wvu277100), h, ba) → new_mkBalBranch6MkBalBranch111(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu2682000, wvu277100, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 11 >= 11, 12 >= 12, 13 >= 13, 14 > 14, 15 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch31(wvu2422, wvu2421, wvu2383, wvu2384, wvu2385, wvu2386, wvu2387, wvu2407, wvu2420, wvu2419, Succ(wvu2678000), Succ(wvu280000), h, ba) → new_mkBalBranch6MkBalBranch31(wvu2422, wvu2421, wvu2383, wvu2384, wvu2385, wvu2386, wvu2387, wvu2407, wvu2420, wvu2419, wvu2678000, wvu280000, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch31(wvu2422, wvu2421, wvu2383, wvu2384, wvu2385, wvu2386, wvu2387, wvu2407, wvu2420, wvu2419, Succ(wvu2678000), Succ(wvu280000), h, ba) → new_mkBalBranch6MkBalBranch31(wvu2422, wvu2421, wvu2383, wvu2384, wvu2385, wvu2386, wvu2387, wvu2407, wvu2420, wvu2419, wvu2678000, wvu280000, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 11 > 11, 12 > 12, 13 >= 13, 14 >= 14
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch40(wvu2422, wvu2421, wvu2383, wvu2384, wvu2385, wvu2386, wvu2387, wvu2407, wvu2420, wvu2419, Succ(wvu2462000), Succ(wvu263400), h, ba) → new_mkBalBranch6MkBalBranch40(wvu2422, wvu2421, wvu2383, wvu2384, wvu2385, wvu2386, wvu2387, wvu2407, wvu2420, wvu2419, wvu2462000, wvu263400, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch40(wvu2422, wvu2421, wvu2383, wvu2384, wvu2385, wvu2386, wvu2387, wvu2407, wvu2420, wvu2419, Succ(wvu2462000), Succ(wvu263400), h, ba) → new_mkBalBranch6MkBalBranch40(wvu2422, wvu2421, wvu2383, wvu2384, wvu2385, wvu2386, wvu2387, wvu2407, wvu2420, wvu2419, wvu2462000, wvu263400, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 11 > 11, 12 > 12, 13 >= 13, 14 >= 14
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch32(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1778000), Succ(wvu224300), h, ba) → new_mkBalBranch6MkBalBranch32(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu1778000, wvu224300, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch32(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1778000), Succ(wvu224300), h, ba) → new_mkBalBranch6MkBalBranch32(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu1778000, wvu224300, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 > 10, 11 > 11, 12 >= 12, 13 >= 13
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch41(wvu2760, wvu2761, wvu2762, wvu2763, wvu2764, wvu2765, wvu2766, wvu2767, wvu2768, Succ(wvu27690), Succ(wvu27700), h, ba) → new_mkBalBranch6MkBalBranch41(wvu2760, wvu2761, wvu2762, wvu2763, wvu2764, wvu2765, wvu2766, wvu2767, wvu2768, wvu27690, wvu27700, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch41(wvu2760, wvu2761, wvu2762, wvu2763, wvu2764, wvu2765, wvu2766, wvu2767, wvu2768, Succ(wvu27690), Succ(wvu27700), h, ba) → new_mkBalBranch6MkBalBranch41(wvu2760, wvu2761, wvu2762, wvu2763, wvu2764, wvu2765, wvu2766, wvu2767, wvu2768, wvu27690, wvu27700, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 > 10, 11 > 11, 12 >= 12, 13 >= 13
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch012(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1789000), Succ(wvu240300), h, ba) → new_mkBalBranch6MkBalBranch012(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu1789000, wvu240300, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch012(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1789000), Succ(wvu240300), h, ba) → new_mkBalBranch6MkBalBranch012(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu1789000, wvu240300, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 > 9, 10 > 10, 11 >= 11, 12 >= 12
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch112(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu2694000), Succ(wvu281000), h, ba) → new_mkBalBranch6MkBalBranch112(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu2694000, wvu281000, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch112(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu2694000), Succ(wvu281000), h, ba) → new_mkBalBranch6MkBalBranch112(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu2694000, wvu281000, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 11 >= 11, 12 >= 12, 13 > 13, 14 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch33(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1781000), Succ(wvu233400), h, ba) → new_mkBalBranch6MkBalBranch33(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu1781000, wvu233400, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch33(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1781000), Succ(wvu233400), h, ba) → new_mkBalBranch6MkBalBranch33(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu1781000, wvu233400, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 > 9, 10 > 10, 11 >= 11, 12 >= 12
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch113(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Succ(wvu2802000), Succ(wvu283400), h, ba) → new_mkBalBranch6MkBalBranch113(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, wvu2802000, wvu283400, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch113(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Succ(wvu2802000), Succ(wvu283400), h, ba) → new_mkBalBranch6MkBalBranch113(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, wvu2802000, wvu283400, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 11 >= 11, 12 >= 12, 13 >= 13, 14 > 14, 15 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch34(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Succ(wvu2775000), Succ(wvu278800), h, ba) → new_mkBalBranch6MkBalBranch34(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu2775000, wvu278800, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch34(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Succ(wvu2775000), Succ(wvu278800), h, ba) → new_mkBalBranch6MkBalBranch34(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu2775000, wvu278800, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 > 10, 11 > 11, 12 >= 12, 13 >= 13
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch013(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1783000), Succ(wvu259000), h, ba) → new_mkBalBranch6MkBalBranch013(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu1783000, wvu259000, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch013(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1783000), Succ(wvu259000), h, ba) → new_mkBalBranch6MkBalBranch013(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu1783000, wvu259000, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 > 10, 11 > 11, 12 >= 12, 13 >= 13
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch42(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Succ(wvu27570), Succ(wvu27580), h, ba) → new_mkBalBranch6MkBalBranch42(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu27570, wvu27580, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch42(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Succ(wvu27570), Succ(wvu27580), h, ba) → new_mkBalBranch6MkBalBranch42(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu27570, wvu27580, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 > 10, 11 > 11, 12 >= 12, 13 >= 13
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch114(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu2673000), Succ(wvu273700), h, ba) → new_mkBalBranch6MkBalBranch114(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu2673000, wvu273700, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch114(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu2673000), Succ(wvu273700), h, ba) → new_mkBalBranch6MkBalBranch114(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu2673000, wvu273700, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 > 9, 10 > 10, 11 >= 11, 12 >= 12
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch35(wvu1487, wvu1488, wvu1693, wvu1692, Succ(wvu1771000), Succ(wvu219500), h, ba) → new_mkBalBranch6MkBalBranch35(wvu1487, wvu1488, wvu1693, wvu1692, wvu1771000, wvu219500, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch35(wvu1487, wvu1488, wvu1693, wvu1692, Succ(wvu1771000), Succ(wvu219500), h, ba) → new_mkBalBranch6MkBalBranch35(wvu1487, wvu1488, wvu1693, wvu1692, wvu1771000, wvu219500, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 > 5, 6 > 6, 7 >= 7, 8 >= 8
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch(wvu340, wvu341, wvu3430, wvu3431, wvu3432, wvu3433, wvu3434, wvu344, h) → new_deleteMin(wvu3430, wvu3431, wvu3432, wvu3433, wvu3434, h)
new_mkBalBranch(wvu340, wvu341, wvu3430, wvu3431, wvu3432, Branch(wvu34330, wvu34331, wvu34332, wvu34333, wvu34334), wvu3434, wvu344, h) → new_mkBalBranch(wvu3430, wvu3431, wvu34330, wvu34331, wvu34332, wvu34333, wvu34334, wvu3434, h)
new_deleteMin(wvu3430, wvu3431, wvu3432, Branch(wvu34330, wvu34331, wvu34332, wvu34333, wvu34334), wvu3434, h) → new_mkBalBranch(wvu3430, wvu3431, wvu34330, wvu34331, wvu34332, wvu34333, wvu34334, wvu3434, h)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_deleteMin(wvu3430, wvu3431, wvu3432, Branch(wvu34330, wvu34331, wvu34332, wvu34333, wvu34334), wvu3434, h) → new_mkBalBranch(wvu3430, wvu3431, wvu34330, wvu34331, wvu34332, wvu34333, wvu34334, wvu3434, h)
The graph contains the following edges 1 >= 1, 2 >= 2, 4 > 3, 4 > 4, 4 > 5, 4 > 6, 4 > 7, 5 >= 8, 6 >= 9
- new_mkBalBranch(wvu340, wvu341, wvu3430, wvu3431, wvu3432, Branch(wvu34330, wvu34331, wvu34332, wvu34333, wvu34334), wvu3434, wvu344, h) → new_mkBalBranch(wvu3430, wvu3431, wvu34330, wvu34331, wvu34332, wvu34333, wvu34334, wvu3434, h)
The graph contains the following edges 3 >= 1, 4 >= 2, 6 > 3, 6 > 4, 6 > 5, 6 > 6, 6 > 7, 7 >= 8, 9 >= 9
- new_mkBalBranch(wvu340, wvu341, wvu3430, wvu3431, wvu3432, wvu3433, wvu3434, wvu344, h) → new_deleteMin(wvu3430, wvu3431, wvu3432, wvu3433, wvu3434, h)
The graph contains the following edges 3 >= 1, 4 >= 2, 5 >= 3, 6 >= 4, 7 >= 5, 9 >= 6
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_deleteMax(wvu14960, wvu14961, wvu14962, wvu14963, Branch(wvu149640, wvu149641, wvu149642, wvu149643, wvu149644), h, ba) → new_mkBalBranch0(wvu14960, wvu14961, wvu14963, wvu149640, wvu149641, wvu149642, wvu149643, wvu149644, h, ba)
new_mkBalBranch6MkBalBranch5(wvu1492, wvu1493, wvu14960, wvu14961, wvu14962, wvu14963, Branch(wvu149640, wvu149641, wvu149642, wvu149643, wvu149644), wvu1495, wvu1827, h, ba) → new_mkBalBranch0(wvu14960, wvu14961, wvu14963, wvu149640, wvu149641, wvu149642, wvu149643, wvu149644, h, ba)
new_mkBalBranch0(wvu1492, wvu1493, wvu1495, wvu14960, wvu14961, wvu14962, wvu14963, wvu14964, h, ba) → new_deleteMax(wvu14960, wvu14961, wvu14962, wvu14963, wvu14964, h, ba)
new_mkBalBranch0(wvu1492, wvu1493, wvu1495, wvu14960, wvu14961, wvu14962, wvu14963, wvu14964, h, ba) → new_mkBalBranch6MkBalBranch5(wvu1492, wvu1493, wvu14960, wvu14961, wvu14962, wvu14963, wvu14964, wvu1495, new_ps(wvu1492, wvu1493, new_deleteMax0(wvu14960, wvu14961, wvu14962, wvu14963, wvu14964, h, ba), wvu1495, wvu1495, h, ba), h, ba)
The TRS R consists of the following rules:
new_mkBalBranch6MkBalBranch1138(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, h, ba) → new_mkBalBranch6MkBalBranch1136(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch1(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, EmptyFM, h, ba) → error([])
new_mkBalBranch1(wvu1492, wvu1493, wvu1495, wvu14960, wvu14961, wvu14962, wvu14963, wvu14964, h, ba) → new_mkBalBranch6MkBalBranch53(wvu1492, wvu1493, wvu14960, wvu14961, wvu14962, wvu14963, wvu14964, wvu1495, new_ps(wvu1492, wvu1493, new_deleteMax0(wvu14960, wvu14961, wvu14962, wvu14963, wvu14964, h, ba), wvu1495, wvu1495, h, ba), h, ba)
new_mkBalBranch6MkBalBranch380(wvu1487, wvu1488, wvu1693, wvu1692, h, ba) → new_mkBranch(Succ(Zero), wvu1487, wvu1488, wvu1692, EmptyFM, h, ba)
new_mkBalBranch6MkBalBranch3105(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178200, wvu2342, h, ba) → new_mkBalBranch6MkBalBranch323(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178200, wvu2342, h, ba)
new_mkBalBranch6MkBalBranch1180(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Pos(Zero), Pos(wvu28030), bb, bc) → new_mkBalBranch6MkBalBranch1156(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, new_primMulNat1(wvu28030), bb, bc)
new_mkBalBranch6MkBalBranch390(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Neg(Succ(wvu178200)), h, ba) → new_mkBalBranch6MkBalBranch392(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178200, new_mkBalBranch6Size_r2(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch0138(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Zero, bh, ca) → new_mkBalBranch6MkBalBranch0129(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, bh, ca)
new_mkBalBranch6Size_l(wvu1487, wvu1488, wvu1491, wvu1826, h, ba) → new_sizeFM(wvu1826, h, ba)
new_mkBalBranch6MkBalBranch374(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Pos(Zero), h, ba) → new_mkBalBranch6MkBalBranch345(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, new_mkBalBranch6Size_r1(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch1129(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, wvu268200, h, ba) → new_mkBalBranch6MkBalBranch117(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch116(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba) → new_mkBalBranch6MkBalBranch1148(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch394(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Succ(wvu27900), bb, bc) → new_mkBalBranch6MkBalBranch395(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Zero, wvu27900, bb, bc)
new_mkBalBranch6MkBalBranch1139(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Pos(Succ(wvu267300)), Pos(wvu26740), h, ba) → new_mkBalBranch6MkBalBranch1140(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu267300, new_primMulNat1(wvu26740), h, ba)
new_mkBalBranch6MkBalBranch49(wvu1487, wvu1488, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch327(wvu1487, wvu1488, wvu1693, wvu1692, new_mkBalBranch6Size_l0(wvu1487, wvu1488, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch388(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu177800, Zero, h, ba) → new_mkBalBranch6MkBalBranch348(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1137(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Succ(wvu2802000), Succ(wvu283400), bb, bc) → new_mkBalBranch6MkBalBranch1137(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, wvu2802000, wvu283400, bb, bc)
new_mkBalBranch6MkBalBranch1144(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu267300, wvu2743, h, ba) → new_mkBalBranch6MkBalBranch1158(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch358(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu23450), h, ba) → new_mkBalBranch6MkBalBranch325(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch0122(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1783000), Zero, h, ba) → new_mkBalBranch6MkBalBranch018(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1171(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu270600, wvu2818, h, ba) → new_mkBalBranch6MkBalBranch1170(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu270600, wvu2818, h, ba)
new_mkBalBranch6MkBalBranch340(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, bb, bc) → new_mkBranch(Succ(Zero), wvu2748, wvu2749, wvu2756, Branch(wvu2750, wvu2751, Pos(Succ(wvu2752)), wvu2753, wvu2754), bb, bc)
new_mkBalBranch6MkBalBranch394(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Zero, bb, bc) → new_mkBalBranch6MkBalBranch339(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, bb, bc)
new_mkBalBranch6MkBalBranch1165(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu28120), h, ba) → new_mkBalBranch6MkBalBranch1166(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, wvu28120, h, ba)
new_mkBalBranch6MkBalBranch3102(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178200, wvu2343, h, ba) → new_mkBalBranch6MkBalBranch325(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch118(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba) → new_mkBalBranch6MkBalBranch1148(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch341(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Zero, bb, bc) → new_mkBalBranch6MkBalBranch339(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, bb, bc)
new_mkBalBranch6MkBalBranch342(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch389(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch426(wvu1487, wvu1488, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch410(wvu1487, wvu1488, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1130(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Neg(Zero), Neg(wvu27070), h, ba) → new_mkBalBranch6MkBalBranch1169(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, new_primMulNat1(wvu27070), h, ba)
new_primPlusInt2(Pos(wvu18430), wvu1487, wvu1488, wvu1491, wvu1825, h, ba) → new_primPlusInt0(wvu18430, new_sizeFM(wvu1491, h, ba))
new_mkBalBranch6MkBalBranch418(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu1765, h, ba) → new_mkBalBranch6MkBalBranch48(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu1765, Succ(wvu1491200), h, ba)
new_mkBalBranch6MkBalBranch3100(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178100, Neg(wvu22030), h, ba) → new_mkBalBranch6MkBalBranch328(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178100, new_primMulNat(wvu22030), h, ba)
new_mkBalBranch6MkBalBranch0145(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Zero, wvu178300, h, ba) → new_mkBalBranch6MkBalBranch0123(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1127(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, wvu280200, wvu2838, bb, bc) → new_mkBalBranch6MkBalBranch1128(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, bb, bc)
new_mkBalBranch6MkBalBranch0150(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, wvu182300, h, ba) → new_mkBalBranch6MkBalBranch0112(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch425(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Succ(wvu27570), Succ(wvu27580), bb, bc) → new_mkBalBranch6MkBalBranch425(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu27570, wvu27580, bb, bc)
new_mkBalBranch6MkBalBranch1137(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Zero, Succ(wvu283400), bb, bc) → new_mkBalBranch6MkBalBranch1128(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, bb, bc)
new_primMulNat0(wvu174900) → new_primPlusNat0(Zero, Succ(wvu174900))
new_mkBalBranch6MkBalBranch1139(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Neg(Zero), Pos(wvu26740), h, ba) → new_mkBalBranch6MkBalBranch1146(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, new_primMulNat1(wvu26740), h, ba)
new_mkBalBranch6MkBalBranch0147(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu24260), h, ba) → new_mkBalBranch6MkBalBranch0112(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1114(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu269400, wvu2811, h, ba) → new_mkBalBranch6MkBalBranch1115(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch1151(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu267300, Zero, h, ba) → new_mkBalBranch6MkBalBranch1149(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch350(wvu1487, wvu1488, wvu1693, wvu1692, Neg(wvu20950), h, ba) → new_mkBalBranch6MkBalBranch384(wvu1487, wvu1488, wvu1693, wvu1692, new_primMulNat(wvu20950), h, ba)
new_mkBalBranch6MkBalBranch1134(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, Succ(wvu281000), h, ba) → new_mkBalBranch6MkBalBranch1135(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch1184(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Zero, bb, bc) → new_mkBalBranch6MkBalBranch1133(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, bb, bc)
new_primMulNat(Succ(wvu174900)) → new_primPlusNat0(new_primPlusNat0(new_primPlusNat0(new_primPlusNat0(new_primMulNat0(wvu174900), Succ(wvu174900)), Succ(wvu174900)), Succ(wvu174900)), Succ(wvu174900))
new_mkBalBranch6MkBalBranch1152(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu2673000), Zero, h, ba) → new_mkBalBranch6MkBalBranch1149(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch015(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Neg(Zero), Neg(wvu18240), h, ba) → new_mkBalBranch6MkBalBranch0156(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat1(wvu18240), h, ba)
new_mkBalBranch6MkBalBranch019(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch016(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1180(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Neg(Zero), Pos(wvu28030), bb, bc) → new_mkBalBranch6MkBalBranch1161(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, new_primMulNat1(wvu28030), bb, bc)
new_mkBalBranch6MkBalBranch1111(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba) → new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero))))))), wvu16920, wvu16921, wvu16923, new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero)))))))), wvu1487, wvu1488, wvu16924, Branch(wvu14910, wvu14911, Neg(Zero), wvu14913, wvu14914), h, ba), h, ba)
new_mkBalBranch6MkBalBranch361(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu177800, wvu2244, h, ba) → new_mkBalBranch6MkBalBranch348(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1145(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu267300, wvu2744, h, ba) → new_mkBalBranch6MkBalBranch1173(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu2744, wvu267300, h, ba)
new_mkBalBranch6MkBalBranch1136(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba) → new_mkBalBranch6MkBalBranch1153(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch014(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Pos(Zero), Neg(wvu17840), h, ba) → new_mkBalBranch6MkBalBranch017(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat1(wvu17840), h, ba)
new_mkBalBranch6MkBalBranch1162(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, wvu280200, wvu2835, bb, bc) → new_mkBalBranch6MkBalBranch1132(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, bb, bc)
new_mkBalBranch6MkBalBranch399(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch337(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch366(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1778000), Zero, h, ba) → new_mkBalBranch6MkBalBranch348(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch369(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Pos(wvu22060), h, ba) → new_mkBalBranch6MkBalBranch338(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat(wvu22060), h, ba)
new_mkBalBranch6MkBalBranch343(wvu1487, wvu1488, wvu1693, wvu1692, wvu177100, Pos(wvu20940), h, ba) → new_mkBalBranch6MkBalBranch312(wvu1487, wvu1488, wvu1693, wvu1692, wvu177100, new_primMulNat(wvu20940), h, ba)
new_mkBalBranch6MkBalBranch1169(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu28250), h, ba) → new_mkBalBranch6MkBalBranch1170(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu28250, Zero, h, ba)
new_mkBalBranch6MkBalBranch1132(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, bb, bc) → new_mkBalBranch6MkBalBranch1157(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, bb, bc)
new_mkBalBranch6MkBalBranch330(wvu1487, wvu1488, wvu1693, wvu1692, Succ(wvu1771000), Zero, h, ba) → new_mkBalBranch6MkBalBranch331(wvu1487, wvu1488, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch334(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch335(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1116(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu268200, wvu2771, h, ba) → new_mkBalBranch6MkBalBranch119(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu268200, wvu2771, h, ba)
new_mkBalBranch6MkBalBranch0136(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Neg(Succ(wvu268000)), Pos(wvu26810), bh, ca) → new_mkBalBranch6MkBalBranch0140(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, wvu268000, new_primMulNat1(wvu26810), bh, ca)
new_primMulNat1(Zero) → Zero
new_mkBalBranch6MkBalBranch1146(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu27450), h, ba) → new_mkBalBranch6MkBalBranch1158(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch1172(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu269400, wvu2815, h, ba) → new_mkBalBranch6MkBalBranch1166(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu2815, wvu269400, h, ba)
new_mkBalBranch6MkBalBranch115(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, Succ(wvu277100), h, ba) → new_mkBalBranch6MkBalBranch117(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch332(wvu1487, wvu1488, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch380(wvu1487, wvu1488, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1179(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu269400, Zero, h, ba) → new_mkBalBranch6MkBalBranch1115(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch336(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch337(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch51(wvu1487, wvu1488, Branch(wvu14910, wvu14911, Pos(Zero), wvu14913, wvu14914), wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch423(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_mkBalBranch6Size_l1(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch315(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch311(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch014(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Pos(Succ(wvu178300)), Pos(wvu17840), h, ba) → new_mkBalBranch6MkBalBranch0153(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu178300, new_primMulNat1(wvu17840), h, ba)
new_mkBalBranch6MkBalBranch0112(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBranch(Succ(Succ(Zero)), wvu14910, wvu14911, new_mkBranch(Succ(Succ(Succ(Zero))), wvu1487, wvu1488, wvu1692, wvu14913, h, ba), wvu14914, h, ba)
new_mkBalBranch6MkBalBranch1120(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Neg(Succ(wvu268200)), Pos(wvu26830), h, ba) → new_mkBalBranch6MkBalBranch1124(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu268200, new_primMulNat1(wvu26830), h, ba)
new_mkBalBranch6MkBalBranch422(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Neg(wvu17550), h, ba) → new_mkBalBranch6MkBalBranch44(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat(wvu17550), h, ba)
new_mkBalBranch6MkBalBranch43(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch014(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, new_sizeFM(wvu14913, h, ba), new_sizeFM(wvu14914, h, ba), h, ba)
new_primPlusInt0(wvu3320, Pos(wvu520)) → Pos(new_primPlusNat0(wvu3320, wvu520))
new_mkBalBranch6MkBalBranch50(wvu1487, wvu1488, wvu1491, wvu1693, wvu1692, Pos(Zero), h, ba) → new_mkBalBranch6MkBalBranch52(wvu1487, wvu1488, wvu1491, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch387(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu277500, wvu2789, bb, bc) → new_mkBalBranch6MkBalBranch386(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, bb, bc)
new_mkBalBranch6MkBalBranch357(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch335(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch327(wvu1487, wvu1488, wvu1693, wvu1692, Neg(Zero), h, ba) → new_mkBalBranch6MkBalBranch352(wvu1487, wvu1488, wvu1693, wvu1692, new_mkBalBranch6Size_r0(wvu1487, wvu1488, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch356(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Pos(wvu22080), h, ba) → new_mkBalBranch6MkBalBranch357(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat(wvu22080), h, ba)
new_mkBalBranch6MkBalBranch50(wvu1487, wvu1488, wvu1491, wvu1693, wvu1692, Pos(Succ(Succ(Succ(wvu16940000)))), h, ba) → new_mkBalBranch6MkBalBranch51(wvu1487, wvu1488, wvu1491, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch330(wvu1487, wvu1488, wvu1693, wvu1692, Zero, Zero, h, ba) → new_mkBalBranch6MkBalBranch333(wvu1487, wvu1488, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch366(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1778000), Succ(wvu224300), h, ba) → new_mkBalBranch6MkBalBranch366(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu1778000, wvu224300, h, ba)
new_mkBalBranch6MkBalBranch1120(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Neg(Zero), Pos(wvu26830), h, ba) → new_mkBalBranch6MkBalBranch1126(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, new_primMulNat1(wvu26830), h, ba)
new_mkBalBranch6MkBalBranch1166(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu28150), wvu269400, h, ba) → new_mkBalBranch6MkBalBranch1134(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu28150, wvu269400, h, ba)
new_mkBalBranch6MkBalBranch366(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Zero, Zero, h, ba) → new_mkBalBranch6MkBalBranch349(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch419(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch420(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_primPlusInt(Pos(wvu27240), wvu2716, wvu2714, wvu2717, bd, be) → new_primPlusInt0(wvu27240, new_sizeFM(wvu2717, bd, be))
new_mkBalBranch6MkBalBranch0126(wvu1487, wvu1488, wvu14910, wvu14911, EmptyFM, wvu14914, wvu1693, wvu1692, h, ba) → error([])
new_mkBalBranch6MkBalBranch373(wvu1487, wvu1488, wvu1693, wvu1692, wvu177100, wvu2199, h, ba) → new_mkBalBranch6MkBalBranch332(wvu1487, wvu1488, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1170(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu270600, Succ(wvu28180), h, ba) → new_mkBalBranch6MkBalBranch1164(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu270600, wvu28180, h, ba)
new_mkBalBranch6MkBalBranch414(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu17660), h, ba) → new_mkBalBranch6MkBalBranch415(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch53(wvu1492, wvu1493, wvu14960, wvu14961, wvu14962, wvu14963, wvu14964, wvu1495, wvu1827, h, ba) → new_mkBalBranch6MkBalBranch50(wvu1492, wvu1493, new_deleteMax0(wvu14960, wvu14961, wvu14962, wvu14963, wvu14964, h, ba), wvu1495, wvu1495, wvu1827, h, ba)
new_mkBalBranch6MkBalBranch0154(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu23990), h, ba) → new_mkBalBranch6MkBalBranch0123(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch386(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, EmptyFM, bb, bc) → error([])
new_deleteMax0(wvu14960, wvu14961, wvu14962, wvu14963, Branch(wvu149640, wvu149641, wvu149642, wvu149643, wvu149644), h, ba) → new_mkBalBranch1(wvu14960, wvu14961, wvu14963, wvu149640, wvu149641, wvu149642, wvu149643, wvu149644, h, ba)
new_primPlusInt1(wvu3320, Pos(wvu520)) → new_primMinusNat0(wvu520, wvu3320)
new_mkBalBranch6MkBalBranch0155(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch019(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1164(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, Succ(wvu281800), h, ba) → new_mkBalBranch6MkBalBranch1111(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch425(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Zero, Zero, bb, bc) → new_mkBalBranch6MkBalBranch411(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, bb, bc)
new_mkBalBranch6MkBalBranch329(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, EmptyFM, h, ba) → error([])
new_mkBalBranch6MkBalBranch0132(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch0117(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch38(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu277500, Pos(wvu27850), bb, bc) → new_mkBalBranch6MkBalBranch39(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu277500, new_primMulNat(wvu27850), bb, bc)
new_mkBalBranch6MkBalBranch410(wvu1487, wvu1488, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch49(wvu1487, wvu1488, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch357(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu23440), h, ba) → new_mkBalBranch6MkBalBranch368(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, wvu23440, h, ba)
new_mkBalBranch6MkBalBranch359(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu177800, Pos(wvu21610), h, ba) → new_mkBalBranch6MkBalBranch360(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu177800, new_primMulNat(wvu21610), h, ba)
new_mkBalBranch6MkBalBranch0116(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, wvu178900, h, ba) → new_mkBalBranch6MkBalBranch0119(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1175(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, EmptyFM, h, ba) → error([])
new_mkBalBranch6MkBalBranch355(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1781000), Succ(wvu233400), h, ba) → new_mkBalBranch6MkBalBranch355(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu1781000, wvu233400, h, ba)
new_mkBalBranch6MkBalBranch46(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch47(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1168(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Pos(Zero), Neg(wvu26950), h, ba) → new_mkBalBranch6MkBalBranch1177(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, new_primMulNat1(wvu26950), h, ba)
new_mkBalBranch6MkBalBranch1148(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, EmptyFM, h, ba) → error([])
new_mkBalBranch6MkBalBranch1154(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu28210), h, ba) → new_mkBalBranch6MkBalBranch1113(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch1131(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Zero, bb, bc) → new_mkBalBranch6MkBalBranch1133(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, bb, bc)
new_mkBalBranch6MkBalBranch0141(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, wvu268000, wvu2732, bh, ca) → new_mkBalBranch6MkBalBranch0157(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, wvu2732, wvu268000, bh, ca)
new_mkBalBranch6MkBalBranch0115(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu26420), h, ba) → new_mkBalBranch6MkBalBranch0116(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, wvu26420, h, ba)
new_mkBalBranch6MkBalBranch378(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch349(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1150(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba) → new_mkBalBranch6MkBalBranch1159(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch427(wvu1487, wvu1488, wvu1693, wvu1692, Pos(wvu17490), h, ba) → new_mkBalBranch6MkBalBranch426(wvu1487, wvu1488, wvu1693, wvu1692, new_primMulNat(wvu17490), h, ba)
new_mkBalBranch6MkBalBranch313(wvu1487, wvu1488, wvu1693, wvu1692, wvu177100, Succ(wvu21950), h, ba) → new_mkBalBranch6MkBalBranch330(wvu1487, wvu1488, wvu1693, wvu1692, wvu177100, wvu21950, h, ba)
new_mkBalBranch6MkBalBranch377(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Neg(wvu21640), h, ba) → new_mkBalBranch6MkBalBranch379(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat(wvu21640), h, ba)
new_mkBalBranch6MkBalBranch1148(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, Branch(wvu169240, wvu169241, wvu169242, wvu169243, wvu169244), h, ba) → new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero))))))))), wvu169240, wvu169241, new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero)))))))))), wvu16920, wvu16921, wvu16923, wvu169243, h, ba), new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero))))))))))), wvu1487, wvu1488, wvu169244, Branch(wvu14910, wvu14911, Neg(Succ(wvu1491200)), wvu14913, wvu14914), h, ba), h, ba)
new_mkBalBranch6MkBalBranch0127(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Zero, Succ(wvu272700), bh, ca) → new_mkBalBranch6MkBalBranch0128(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, bh, ca)
new_mkBalBranch6MkBalBranch015(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Pos(Succ(wvu182300)), Pos(wvu18240), h, ba) → new_mkBalBranch6MkBalBranch0152(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu182300, new_primMulNat1(wvu18240), h, ba)
new_mkBalBranch6MkBalBranch1130(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Pos(Succ(wvu270600)), Pos(wvu27070), h, ba) → new_mkBalBranch6MkBalBranch1171(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu270600, new_primMulNat1(wvu27070), h, ba)
new_mkBalBranch6MkBalBranch1139(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Neg(Succ(wvu267300)), Pos(wvu26740), h, ba) → new_mkBalBranch6MkBalBranch1144(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu267300, new_primMulNat1(wvu26740), h, ba)
new_mkBalBranch6MkBalBranch119(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu268200, Zero, h, ba) → new_mkBalBranch6MkBalBranch116(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch0139(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Succ(wvu27300), bh, ca) → new_mkBalBranch6MkBalBranch0120(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, bh, ca)
new_mkBalBranch6MkBalBranch44(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch45(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch395(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Succ(wvu27930), wvu277500, bb, bc) → new_mkBalBranch6MkBalBranch3101(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu27930, wvu277500, bb, bc)
new_mkBalBranch6MkBalBranch379(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu22500), h, ba) → new_mkBalBranch6MkBalBranch388(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu22500, Zero, h, ba)
new_mkBalBranch6MkBalBranch0127(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Zero, Zero, bh, ca) → new_mkBalBranch6MkBalBranch0129(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, bh, ca)
new_mkBalBranch6MkBalBranch0136(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Neg(Succ(wvu268000)), Neg(wvu26810), bh, ca) → new_mkBalBranch6MkBalBranch0141(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, wvu268000, new_primMulNat1(wvu26810), bh, ca)
new_mkBalBranch6MkBalBranch377(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Pos(wvu21640), h, ba) → new_mkBalBranch6MkBalBranch378(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat(wvu21640), h, ba)
new_mkBalBranch6MkBalBranch383(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178100, Succ(wvu23340), h, ba) → new_mkBalBranch6MkBalBranch355(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178100, wvu23340, h, ba)
new_mkBalBranch6MkBalBranch0122(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Zero, Zero, h, ba) → new_mkBalBranch6MkBalBranch019(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch0125(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch0126(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch397(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Succ(wvu27940), bb, bc) → new_mkBalBranch6MkBalBranch326(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, bb, bc)
new_mkBalBranch6MkBalBranch1120(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Pos(Succ(wvu268200)), Pos(wvu26830), h, ba) → new_mkBalBranch6MkBalBranch1116(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu268200, new_primMulNat1(wvu26830), h, ba)
new_mkBalBranch6MkBalBranch395(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Zero, wvu277500, bb, bc) → new_mkBalBranch6MkBalBranch326(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, bb, bc)
new_mkBalBranch6MkBalBranch1120(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Neg(Zero), Neg(wvu26830), h, ba) → new_mkBalBranch6MkBalBranch1119(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, new_primMulNat1(wvu26830), h, ba)
new_mkBalBranch6MkBalBranch320(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu177800, Pos(wvu21630), h, ba) → new_mkBalBranch6MkBalBranch321(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu177800, new_primMulNat(wvu21630), h, ba)
new_mkBalBranch6MkBalBranch348(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch1(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1130(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Pos(Zero), Neg(wvu27070), h, ba) → new_mkBalBranch6MkBalBranch1154(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, new_primMulNat1(wvu27070), h, ba)
new_mkBalBranch6MkBalBranch385(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Succ(wvu27910), bb, bc) → new_mkBalBranch6MkBalBranch386(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, bb, bc)
new_mkBalBranch6MkBalBranch3101(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Succ(wvu2775000), Zero, bb, bc) → new_mkBalBranch6MkBalBranch386(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, bb, bc)
new_mkBalBranch6MkBalBranch1141(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu267300, wvu2740, h, ba) → new_mkBalBranch6MkBalBranch1149(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch341(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Succ(wvu27950), bb, bc) → new_mkBalBranch6MkBalBranch37(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu27950, Zero, bb, bc)
new_mkBalBranch6MkBalBranch339(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, bb, bc) → new_mkBalBranch6MkBalBranch340(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, bb, bc)
new_mkBalBranch6MkBalBranch1168(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Neg(Succ(wvu269400)), Pos(wvu26950), h, ba) → new_mkBalBranch6MkBalBranch1160(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu269400, new_primMulNat1(wvu26950), h, ba)
new_mkBalBranch6MkBalBranch1168(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Pos(Succ(wvu269400)), Pos(wvu26950), h, ba) → new_mkBalBranch6MkBalBranch1176(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu269400, new_primMulNat1(wvu26950), h, ba)
new_mkBalBranch6MkBalBranch0(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, bh, ca) → new_mkBalBranch6MkBalBranch0136(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, new_sizeFM(wvu2669, bh, ca), new_sizeFM(wvu2670, bh, ca), bh, ca)
new_mkBalBranch6MkBalBranch1183(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, wvu280200, wvu2834, bb, bc) → new_mkBalBranch6MkBalBranch1182(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, wvu280200, wvu2834, bb, bc)
new_mkBalBranch6MkBalBranch36(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu277500, wvu2788, bb, bc) → new_mkBalBranch6MkBalBranch37(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu277500, wvu2788, bb, bc)
new_mkBalBranch6MkBalBranch015(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Pos(Succ(wvu182300)), Neg(wvu18240), h, ba) → new_mkBalBranch6MkBalBranch0146(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu182300, new_primMulNat1(wvu18240), h, ba)
new_mkBalBranch6MkBalBranch1181(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, h, ba) → new_mkBalBranch6MkBalBranch1155(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch393(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Pos(wvu22100), h, ba) → new_mkBalBranch6MkBalBranch3103(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat(wvu22100), h, ba)
new_mkBalBranch6MkBalBranch334(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu23490), h, ba) → new_mkBalBranch6MkBalBranch323(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu23490, Zero, h, ba)
new_mkBalBranch6MkBalBranch0145(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu25920), wvu178300, h, ba) → new_mkBalBranch6MkBalBranch0122(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu25920, wvu178300, h, ba)
new_mkBalBranch6MkBalBranch1(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, Branch(wvu16920, wvu16921, wvu16922, wvu16923, wvu16924), h, ba) → new_mkBalBranch6MkBalBranch1120(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, new_sizeFM(wvu16924, h, ba), new_sizeFM(wvu16923, h, ba), h, ba)
new_mkBalBranch6MkBalBranch423(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Neg(wvu17530), h, ba) → new_mkBalBranch6MkBalBranch424(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat(wvu17530), h, ba)
new_mkBalBranch6MkBalBranch327(wvu1487, wvu1488, wvu1693, wvu1692, Pos(Succ(wvu177100)), h, ba) → new_mkBalBranch6MkBalBranch343(wvu1487, wvu1488, wvu1693, wvu1692, wvu177100, new_mkBalBranch6Size_r0(wvu1487, wvu1488, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch1143(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu27420), h, ba) → new_mkBalBranch6MkBalBranch1149(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch0137(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, wvu268000, wvu2728, bh, ca) → new_mkBalBranch6MkBalBranch0120(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, bh, ca)
new_mkBalBranch6MkBalBranch0127(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Succ(wvu2680000), Zero, bh, ca) → new_mkBalBranch6MkBalBranch0120(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, bh, ca)
new_mkBalBranch6MkBalBranch413(wvu1487, wvu1488, wvu1693, wvu1692, Succ(wvu17590), h, ba) → error([])
new_mkBalBranch6MkBalBranch423(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Pos(wvu17530), h, ba) → new_mkBalBranch6MkBalBranch421(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat(wvu17530), h, ba)
new_mkBalBranch6MkBalBranch014(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Neg(Zero), Pos(wvu17840), h, ba) → new_mkBalBranch6MkBalBranch0154(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat1(wvu17840), h, ba)
new_mkBalBranch6MkBalBranch352(wvu1487, wvu1488, wvu1693, wvu1692, Neg(wvu20970), h, ba) → new_mkBalBranch6MkBalBranch363(wvu1487, wvu1488, wvu1693, wvu1692, new_primMulNat(wvu20970), h, ba)
new_mkBalBranch6MkBalBranch44(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu17670), h, ba) → new_mkBalBranch6MkBalBranch015(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_sizeFM(wvu14913, h, ba), new_sizeFM(wvu14914, h, ba), h, ba)
new_mkBalBranch6MkBalBranch0121(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, Branch(wvu26690, wvu26691, wvu26692, wvu26693, wvu26694), wvu2670, wvu2671, wvu2672, bh, ca) → new_mkBranch(Succ(Succ(Succ(Succ(Zero)))), wvu26690, wvu26691, new_mkBranch(Succ(Succ(Succ(Succ(Succ(Zero))))), wvu2664, wvu2665, wvu2672, wvu26693, bh, ca), new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Zero)))))), wvu2666, wvu2667, wvu26694, wvu2670, bh, ca), bh, ca)
new_mkBalBranch6MkBalBranch1123(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu27740), h, ba) → new_mkBalBranch6MkBalBranch116(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch0111(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch0114(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1128(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, bb, bc) → new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero))))))), wvu27560, wvu27561, wvu27563, new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero)))))))), wvu2748, wvu2749, wvu27564, Branch(wvu2750, wvu2751, Pos(Succ(wvu2752)), wvu2753, wvu2754), bb, bc), bb, bc)
new_mkBalBranch6MkBalBranch1121(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu268200, wvu2772, h, ba) → new_mkBalBranch6MkBalBranch116(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch1120(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Neg(Succ(wvu268200)), Neg(wvu26830), h, ba) → new_mkBalBranch6MkBalBranch1125(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu268200, new_primMulNat1(wvu26830), h, ba)
new_mkBalBranch6MkBalBranch0153(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu178300, Succ(wvu25900), h, ba) → new_mkBalBranch6MkBalBranch0122(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu178300, wvu25900, h, ba)
new_mkBalBranch6MkBalBranch0127(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Succ(wvu2680000), Succ(wvu272700), bh, ca) → new_mkBalBranch6MkBalBranch0127(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, wvu2680000, wvu272700, bh, ca)
new_mkBalBranch6MkBalBranch329(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, Branch(wvu16920, wvu16921, wvu16922, wvu16923, wvu16924), h, ba) → new_mkBalBranch6MkBalBranch1168(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, new_sizeFM(wvu16924, h, ba), new_sizeFM(wvu16923, h, ba), h, ba)
new_mkBalBranch6MkBalBranch1163(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, wvu270600, h, ba) → new_mkBalBranch6MkBalBranch1111(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch1177(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu28130), h, ba) → new_mkBalBranch6MkBalBranch1115(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_primPlusInt0(wvu3320, Neg(wvu520)) → new_primMinusNat0(wvu3320, wvu520)
new_mkBalBranch6MkBalBranch366(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Zero, Succ(wvu224300), h, ba) → new_mkBalBranch6MkBalBranch353(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1168(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Neg(Succ(wvu269400)), Neg(wvu26950), h, ba) → new_mkBalBranch6MkBalBranch1172(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu269400, new_primMulNat1(wvu26950), h, ba)
new_mkBalBranch6MkBalBranch0152(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu182300, wvu2406, h, ba) → new_mkBalBranch6MkBalBranch0148(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu182300, wvu2406, h, ba)
new_mkBalBranch6MkBalBranch346(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch349(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch014(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Neg(Zero), Neg(wvu17840), h, ba) → new_mkBalBranch6MkBalBranch0155(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat1(wvu17840), h, ba)
new_mkBalBranch6MkBalBranch0110(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, Succ(wvu240600), h, ba) → new_mkBalBranch6MkBalBranch0112(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch374(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Neg(Zero), h, ba) → new_mkBalBranch6MkBalBranch377(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, new_mkBalBranch6Size_r1(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch378(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu22490), h, ba) → new_mkBalBranch6MkBalBranch353(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1175(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, Branch(wvu169240, wvu169241, wvu169242, wvu169243, wvu169244), h, ba) → new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero))))))))), wvu169240, wvu169241, new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero)))))))))), wvu16920, wvu16921, wvu16923, wvu169243, h, ba), new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero))))))))))), wvu1487, wvu1488, wvu169244, Branch(wvu14910, wvu14911, Neg(Zero), wvu14913, wvu14914), h, ba), h, ba)
new_mkBranch(wvu2713, wvu2714, wvu2715, wvu2716, wvu2717, bd, be) → Branch(wvu2714, wvu2715, new_primPlusInt(new_primPlusInt0(Succ(Zero), new_sizeFM(wvu2716, bd, be)), wvu2716, wvu2714, wvu2717, bd, be), wvu2716, wvu2717)
new_mkBalBranch6MkBalBranch0136(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Pos(Zero), Pos(wvu26810), bh, ca) → new_mkBalBranch6MkBalBranch0138(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, new_primMulNat1(wvu26810), bh, ca)
new_mkBalBranch6MkBalBranch1142(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu27410), h, ba) → new_mkBalBranch6MkBalBranch1173(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, wvu27410, h, ba)
new_mkBalBranch6MkBalBranch318(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Neg(wvu27840), bb, bc) → new_mkBalBranch6MkBalBranch385(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, new_primMulNat(wvu27840), bb, bc)
new_primMinusNat0(Succ(wvu33200), Zero) → Pos(Succ(wvu33200))
new_sizeFM(EmptyFM, h, ba) → Pos(Zero)
new_mkBalBranch6MkBalBranch428(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Neg(wvu17520), h, ba) → new_mkBalBranch6MkBalBranch416(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat(wvu17520), h, ba)
new_mkBalBranch6MkBalBranch362(wvu1487, wvu1488, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch333(wvu1487, wvu1488, wvu1693, wvu1692, h, ba)
new_mkBalBranch6Size_l3(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, h, ba) → new_sizeFM(wvu1693, h, ba)
new_mkBalBranch6MkBalBranch0132(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu26480), h, ba) → new_mkBalBranch6MkBalBranch0131(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu26480, Zero, h, ba)
new_mkBalBranch6MkBalBranch1137(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Succ(wvu2802000), Zero, bb, bc) → new_mkBalBranch6MkBalBranch1132(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, bb, bc)
new_mkBalBranch6MkBalBranch1155(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba) → new_mkBalBranch6MkBalBranch1175(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch0119(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBranch(Succ(Succ(Zero)), wvu14910, wvu14911, new_mkBranch(Succ(Succ(Succ(Zero))), wvu1487, wvu1488, wvu1692, wvu14913, h, ba), wvu14914, h, ba)
new_mkBalBranch6MkBalBranch0114(wvu1487, wvu1488, wvu14910, wvu14911, Branch(wvu149130, wvu149131, wvu149132, wvu149133, wvu149134), wvu14914, wvu1693, wvu1692, h, ba) → new_mkBranch(Succ(Succ(Succ(Succ(Zero)))), wvu149130, wvu149131, new_mkBranch(Succ(Succ(Succ(Succ(Succ(Zero))))), wvu1487, wvu1488, wvu1692, wvu149133, h, ba), new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Zero)))))), wvu14910, wvu14911, wvu149134, wvu14914, h, ba), h, ba)
new_mkBalBranch6MkBalBranch48(wvu2760, wvu2761, wvu2762, wvu2763, wvu2764, wvu2765, wvu2766, wvu2767, wvu2768, Zero, Zero, bf, bg) → new_mkBalBranch6MkBalBranch47(wvu2760, wvu2761, wvu2762, wvu2763, wvu2764, wvu2765, wvu2766, wvu2767, wvu2768, bf, bg)
new_mkBalBranch6MkBalBranch1168(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Neg(Zero), Neg(wvu26950), h, ba) → new_mkBalBranch6MkBalBranch1178(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, new_primMulNat1(wvu26950), h, ba)
new_mkBalBranch6MkBalBranch331(wvu1487, wvu1488, wvu1693, Branch(wvu16920, wvu16921, wvu16922, wvu16923, wvu16924), h, ba) → new_mkBalBranch6MkBalBranch1139(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, new_sizeFM(wvu16924, h, ba), new_sizeFM(wvu16923, h, ba), h, ba)
new_mkBalBranch6MkBalBranch1164(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu2706000), Succ(wvu281800), h, ba) → new_mkBalBranch6MkBalBranch1164(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu2706000, wvu281800, h, ba)
new_mkBalBranch6MkBalBranch018(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch016(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch385(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Zero, bb, bc) → new_mkBalBranch6MkBalBranch339(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, bb, bc)
new_mkBalBranch6MkBalBranch0142(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Zero, bh, ca) → new_mkBalBranch6MkBalBranch0129(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, bh, ca)
new_mkBalBranch6MkBalBranch1126(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, h, ba) → new_mkBalBranch6MkBalBranch118(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch325(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, EmptyFM, h, ba) → error([])
new_mkBalBranch6MkBalBranch115(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, Zero, h, ba) → new_mkBalBranch6MkBalBranch118(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch015(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Neg(Succ(wvu182300)), Neg(wvu18240), h, ba) → new_mkBalBranch6MkBalBranch0158(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu182300, new_primMulNat1(wvu18240), h, ba)
new_mkBalBranch6MkBalBranch323(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178200, Succ(wvu23420), h, ba) → new_mkBalBranch6MkBalBranch324(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178200, wvu23420, h, ba)
new_mkBalBranch6MkBalBranch37(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu277500, Succ(wvu27880), bb, bc) → new_mkBalBranch6MkBalBranch3101(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu277500, wvu27880, bb, bc)
new_mkBalBranch6MkBalBranch1167(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu270600, wvu2823, h, ba) → new_mkBalBranch6MkBalBranch1163(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu2823, wvu270600, h, ba)
new_mkBalBranch6MkBalBranch52(wvu1487, wvu1488, wvu1491, wvu1693, wvu1692, h, ba) → new_mkBranch(Zero, wvu1487, wvu1488, wvu1692, wvu1491, h, ba)
new_mkBalBranch6MkBalBranch351(wvu1487, wvu1488, wvu1693, wvu1692, wvu177100, Pos(wvu20960), h, ba) → new_mkBalBranch6MkBalBranch373(wvu1487, wvu1488, wvu1693, wvu1692, wvu177100, new_primMulNat(wvu20960), h, ba)
new_mkBalBranch6MkBalBranch0151(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1789000), Succ(wvu240300), h, ba) → new_mkBalBranch6MkBalBranch0151(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu1789000, wvu240300, h, ba)
new_mkBalBranch6MkBalBranch0122(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Zero, Succ(wvu259000), h, ba) → new_mkBalBranch6MkBalBranch0123(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch412(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu1764, h, ba) → new_mkBalBranch6MkBalBranch46(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch393(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Neg(wvu22100), h, ba) → new_mkBalBranch6MkBalBranch334(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat(wvu22100), h, ba)
new_mkBalBranch6MkBalBranch386(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, Branch(wvu27560, wvu27561, wvu27562, wvu27563, wvu27564), bb, bc) → new_mkBalBranch6MkBalBranch1180(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, new_sizeFM(wvu27564, bb, bc), new_sizeFM(wvu27563, bb, bc), bb, bc)
new_mkBalBranch6MkBalBranch1130(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Pos(Succ(wvu270600)), Neg(wvu27070), h, ba) → new_mkBalBranch6MkBalBranch1112(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu270600, new_primMulNat1(wvu27070), h, ba)
new_mkBalBranch6MkBalBranch1182(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, wvu280200, Zero, bb, bc) → new_mkBalBranch6MkBalBranch1132(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, bb, bc)
new_mkBalBranch6MkBalBranch1122(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu27730), h, ba) → new_mkBalBranch6MkBalBranch1129(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, wvu27730, h, ba)
new_mkBalBranch6MkBalBranch0120(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, bh, ca) → new_mkBalBranch6MkBalBranch0121(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, bh, ca)
new_mkBalBranch6MkBalBranch48(wvu2760, wvu2761, wvu2762, wvu2763, wvu2764, wvu2765, wvu2766, wvu2767, wvu2768, Zero, Succ(wvu27700), bf, bg) → new_mkBalBranch6MkBalBranch46(wvu2760, wvu2761, wvu2762, wvu2763, wvu2764, wvu2765, wvu2766, wvu2767, wvu2768, bf, bg)
new_mkBalBranch6MkBalBranch370(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch337(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1134(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, Zero, h, ba) → new_mkBalBranch6MkBalBranch1136(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch1181(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu28200), h, ba) → new_mkBalBranch6MkBalBranch1163(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, wvu28200, h, ba)
new_mkBalBranch6MkBalBranch415(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch390(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_mkBalBranch6Size_l4(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch1173(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, wvu267300, h, ba) → new_mkBalBranch6MkBalBranch1158(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch1180(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Neg(Succ(wvu280200)), Pos(wvu28030), bb, bc) → new_mkBalBranch6MkBalBranch1127(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, wvu280200, new_primMulNat1(wvu28030), bb, bc)
new_primPlusNat0(Succ(wvu33200), Zero) → Succ(wvu33200)
new_primPlusNat0(Zero, Succ(wvu5200)) → Succ(wvu5200)
new_mkBalBranch6MkBalBranch1140(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu267300, wvu2737, h, ba) → new_mkBalBranch6MkBalBranch1151(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu267300, wvu2737, h, ba)
new_mkBalBranch6MkBalBranch1139(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Pos(Succ(wvu267300)), Neg(wvu26740), h, ba) → new_mkBalBranch6MkBalBranch1141(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu267300, new_primMulNat1(wvu26740), h, ba)
new_mkBalBranch6MkBalBranch362(wvu1487, wvu1488, wvu1693, wvu1692, Succ(wvu22010), h, ba) → new_mkBalBranch6MkBalBranch332(wvu1487, wvu1488, wvu1693, wvu1692, h, ba)
new_mkBalBranch6Size_r(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, bb, bc) → new_sizeFM(Branch(wvu2750, wvu2751, Pos(Succ(wvu2752)), wvu2753, wvu2754), bb, bc)
new_mkBalBranch6MkBalBranch413(wvu1487, wvu1488, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch410(wvu1487, wvu1488, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch0136(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Pos(Zero), Neg(wvu26810), bh, ca) → new_mkBalBranch6MkBalBranch0139(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, new_primMulNat1(wvu26810), bh, ca)
new_mkBalBranch6MkBalBranch1159(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, EmptyFM, h, ba) → error([])
new_mkBalBranch6MkBalBranch0135(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, wvu268000, Zero, bh, ca) → new_mkBalBranch6MkBalBranch0120(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, bh, ca)
new_primMulNat(Zero) → Zero
new_mkBalBranch6MkBalBranch416(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu1761, h, ba) → new_mkBalBranch6MkBalBranch43(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1124(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu268200, wvu2776, h, ba) → new_mkBalBranch6MkBalBranch117(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch51(wvu1487, wvu1488, Branch(wvu14910, wvu14911, Neg(Succ(wvu1491200)), wvu14913, wvu14914), wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch417(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, new_mkBalBranch6Size_l2(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch343(wvu1487, wvu1488, wvu1693, wvu1692, wvu177100, Neg(wvu20940), h, ba) → new_mkBalBranch6MkBalBranch344(wvu1487, wvu1488, wvu1693, wvu1692, wvu177100, new_primMulNat(wvu20940), h, ba)
new_mkBalBranch6Size_r3(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, h, ba) → new_sizeFM(Branch(wvu14910, wvu14911, Pos(Zero), wvu14913, wvu14914), h, ba)
new_mkBalBranch6MkBalBranch321(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu177800, wvu2247, h, ba) → new_mkBalBranch6MkBalBranch353(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1178(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, h, ba) → new_mkBalBranch6MkBalBranch1136(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch0129(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, bh, ca) → new_mkBalBranch6MkBalBranch0121(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, bh, ca)
new_mkBalBranch6MkBalBranch0117(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch0126(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch0133(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch0113(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch3101(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Zero, Succ(wvu278800), bb, bc) → new_mkBalBranch6MkBalBranch326(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, bb, bc)
new_mkBalBranch6MkBalBranch1152(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, Zero, h, ba) → new_mkBalBranch6MkBalBranch1150(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch355(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, Zero, h, ba) → new_mkBalBranch6MkBalBranch337(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch117(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba) → new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero))))))), wvu16920, wvu16921, wvu16923, new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero)))))))), wvu1487, wvu1488, wvu16924, Branch(wvu14910, wvu14911, Neg(Succ(wvu1491200)), wvu14913, wvu14914), h, ba), h, ba)
new_mkBalBranch6MkBalBranch311(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBranch(Succ(Zero), wvu1487, wvu1488, wvu1692, Branch(wvu14910, wvu14911, Pos(Zero), wvu14913, wvu14914), h, ba)
new_mkBalBranch6MkBalBranch38(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu277500, Neg(wvu27850), bb, bc) → new_mkBalBranch6MkBalBranch310(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu277500, new_primMulNat(wvu27850), bb, bc)
new_mkBalBranch6MkBalBranch0128(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, bh, ca) → new_mkBranch(Succ(Succ(Zero)), wvu2666, wvu2667, new_mkBranch(Succ(Succ(Succ(Zero))), wvu2664, wvu2665, wvu2672, wvu2669, bh, ca), wvu2670, bh, ca)
new_mkBalBranch6MkBalBranch1125(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu268200, wvu2777, h, ba) → new_mkBalBranch6MkBalBranch1129(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu2777, wvu268200, h, ba)
new_mkBalBranch6MkBalBranch017(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch019(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch383(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178100, Zero, h, ba) → new_mkBalBranch6MkBalBranch329(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1142(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, h, ba) → new_mkBalBranch6MkBalBranch1150(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch0154(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch019(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch382(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178100, wvu2334, h, ba) → new_mkBalBranch6MkBalBranch383(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178100, wvu2334, h, ba)
new_mkBalBranch6MkBalBranch0138(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Succ(wvu27290), bh, ca) → new_mkBalBranch6MkBalBranch0157(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Zero, wvu27290, bh, ca)
new_mkBalBranch6MkBalBranch0147(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch0113(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1174(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu28240), h, ba) → new_mkBalBranch6MkBalBranch1111(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch48(wvu2760, wvu2761, wvu2762, wvu2763, wvu2764, wvu2765, wvu2766, wvu2767, wvu2768, Succ(wvu27690), Succ(wvu27700), bf, bg) → new_mkBalBranch6MkBalBranch48(wvu2760, wvu2761, wvu2762, wvu2763, wvu2764, wvu2765, wvu2766, wvu2767, wvu2768, wvu27690, wvu27700, bf, bg)
new_mkBalBranch6MkBalBranch0156(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu24270), h, ba) → new_mkBalBranch6MkBalBranch0148(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu24270, Zero, h, ba)
new_mkBalBranch6MkBalBranch0135(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, wvu268000, Succ(wvu27270), bh, ca) → new_mkBalBranch6MkBalBranch0127(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, wvu268000, wvu27270, bh, ca)
new_mkBalBranch6MkBalBranch1157(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, Branch(wvu275640, wvu275641, wvu275642, wvu275643, wvu275644), bb, bc) → new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero))))))))), wvu275640, wvu275641, new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero)))))))))), wvu27560, wvu27561, wvu27563, wvu275643, bb, bc), new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero))))))))))), wvu2748, wvu2749, wvu275644, Branch(wvu2750, wvu2751, Pos(Succ(wvu2752)), wvu2753, wvu2754), bb, bc), bb, bc)
new_mkBalBranch6MkBalBranch1157(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, EmptyFM, bb, bc) → error([])
new_mkBalBranch6MkBalBranch1120(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Pos(Zero), Neg(wvu26830), h, ba) → new_mkBalBranch6MkBalBranch1123(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, new_primMulNat1(wvu26830), h, ba)
new_mkBalBranch6MkBalBranch1168(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Pos(Succ(wvu269400)), Neg(wvu26950), h, ba) → new_mkBalBranch6MkBalBranch1114(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu269400, new_primMulNat1(wvu26950), h, ba)
new_mkBalBranch6MkBalBranch1120(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Pos(Zero), Pos(wvu26830), h, ba) → new_mkBalBranch6MkBalBranch1122(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, new_primMulNat1(wvu26830), h, ba)
new_primPlusInt1(wvu3320, Neg(wvu520)) → Neg(new_primPlusNat0(wvu3320, wvu520))
new_mkBalBranch6MkBalBranch368(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu23470), wvu178200, h, ba) → new_mkBalBranch6MkBalBranch324(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu23470, wvu178200, h, ba)
new_mkBalBranch6MkBalBranch396(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu22480), wvu177800, h, ba) → new_mkBalBranch6MkBalBranch366(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu22480, wvu177800, h, ba)
new_mkBalBranch6Size_l0(wvu1487, wvu1488, wvu1693, h, ba) → new_sizeFM(wvu1693, h, ba)
new_mkBalBranch6MkBalBranch1156(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Zero, bb, bc) → new_mkBalBranch6MkBalBranch1133(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, bb, bc)
new_mkBalBranch6MkBalBranch330(wvu1487, wvu1488, wvu1693, wvu1692, Zero, Succ(wvu219500), h, ba) → new_mkBalBranch6MkBalBranch332(wvu1487, wvu1488, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1139(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Pos(Zero), Pos(wvu26740), h, ba) → new_mkBalBranch6MkBalBranch1142(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, new_primMulNat1(wvu26740), h, ba)
new_mkBalBranch6MkBalBranch0151(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, Succ(wvu240300), h, ba) → new_mkBalBranch6MkBalBranch0119(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch0144(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu23950), h, ba) → new_mkBalBranch6MkBalBranch0145(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Zero, wvu23950, h, ba)
new_mkBalBranch6MkBalBranch1182(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, wvu280200, Succ(wvu28340), bb, bc) → new_mkBalBranch6MkBalBranch1137(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, wvu280200, wvu28340, bb, bc)
new_mkBalBranch6MkBalBranch1156(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Succ(wvu28360), bb, bc) → new_mkBalBranch6MkBalBranch1118(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Zero, wvu28360, bb, bc)
new_mkBalBranch6MkBalBranch015(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Neg(Zero), Pos(wvu18240), h, ba) → new_mkBalBranch6MkBalBranch0147(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat1(wvu18240), h, ba)
new_mkBalBranch6MkBalBranch363(wvu1487, wvu1488, wvu1693, wvu1692, Succ(wvu22020), h, ba) → new_mkBalBranch6MkBalBranch313(wvu1487, wvu1488, wvu1693, wvu1692, wvu22020, Zero, h, ba)
new_mkBalBranch6MkBalBranch391(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178200, Pos(wvu22070), h, ba) → new_mkBalBranch6MkBalBranch3105(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178200, new_primMulNat(wvu22070), h, ba)
new_mkBalBranch6MkBalBranch1139(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Pos(Zero), Neg(wvu26740), h, ba) → new_mkBalBranch6MkBalBranch1143(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, new_primMulNat1(wvu26740), h, ba)
new_mkBalBranch6MkBalBranch347(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch349(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch372(wvu1487, wvu1488, wvu1693, wvu1692, Succ(wvu22000), wvu177100, h, ba) → new_mkBalBranch6MkBalBranch330(wvu1487, wvu1488, wvu1693, wvu1692, wvu22000, wvu177100, h, ba)
new_mkBalBranch6MkBalBranch1131(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Succ(wvu28370), bb, bc) → new_mkBalBranch6MkBalBranch1132(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, bb, bc)
new_mkBalBranch6MkBalBranch324(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1782000), Succ(wvu234200), h, ba) → new_mkBalBranch6MkBalBranch324(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu1782000, wvu234200, h, ba)
new_mkBalBranch6MkBalBranch47(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch374(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, new_mkBalBranch6Size_l2(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch0130(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Pos(Zero), Pos(wvu17900), h, ba) → new_mkBalBranch6MkBalBranch0115(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat1(wvu17900), h, ba)
new_mkBalBranch6MkBalBranch119(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu268200, Succ(wvu27710), h, ba) → new_mkBalBranch6MkBalBranch115(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu268200, wvu27710, h, ba)
new_mkBalBranch6MkBalBranch345(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Pos(wvu21620), h, ba) → new_mkBalBranch6MkBalBranch346(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat(wvu21620), h, ba)
new_mkBalBranch6Size_l2(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, h, ba) → new_sizeFM(wvu1693, h, ba)
new_mkBalBranch6MkBalBranch0150(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu24250), wvu182300, h, ba) → new_mkBalBranch6MkBalBranch0110(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu24250, wvu182300, h, ba)
new_mkBalBranch6MkBalBranch1165(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, h, ba) → new_mkBalBranch6MkBalBranch1136(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch316(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Neg(Succ(wvu277500)), bb, bc) → new_mkBalBranch6MkBalBranch38(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu277500, new_mkBalBranch6Size_r(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, bb, bc), bb, bc)
new_mkBalBranch6MkBalBranch424(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch419(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1122(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, h, ba) → new_mkBalBranch6MkBalBranch118(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch1158(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba) → new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero))))))), wvu16920, wvu16921, wvu16923, new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero)))))))), wvu1487, wvu1488, wvu16924, EmptyFM, h, ba), h, ba)
new_mkBalBranch6MkBalBranch331(wvu1487, wvu1488, wvu1693, EmptyFM, h, ba) → error([])
new_mkBalBranch6MkBalBranch1147(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, h, ba) → new_mkBalBranch6MkBalBranch1150(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch364(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178100, Pos(wvu22050), h, ba) → new_mkBalBranch6MkBalBranch314(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178100, new_primMulNat(wvu22050), h, ba)
new_mkBalBranch6MkBalBranch0118(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch0117(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1112(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu270600, wvu2819, h, ba) → new_mkBalBranch6MkBalBranch1113(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch1174(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, h, ba) → new_mkBalBranch6MkBalBranch1155(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch3104(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178200, wvu2347, h, ba) → new_mkBalBranch6MkBalBranch368(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu2347, wvu178200, h, ba)
new_mkBalBranch6MkBalBranch0148(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu182300, Succ(wvu24060), h, ba) → new_mkBalBranch6MkBalBranch0110(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu182300, wvu24060, h, ba)
new_mkBalBranch6MkBalBranch1173(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu27440), wvu267300, h, ba) → new_mkBalBranch6MkBalBranch1152(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu27440, wvu267300, h, ba)
new_mkBalBranch6MkBalBranch1153(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, EmptyFM, h, ba) → error([])
new_mkBalBranch6MkBalBranch346(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu22450), h, ba) → new_mkBalBranch6MkBalBranch396(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Zero, wvu22450, h, ba)
new_mkBalBranch6MkBalBranch0151(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1789000), Zero, h, ba) → new_mkBalBranch6MkBalBranch0125(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch3101(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Zero, Zero, bb, bc) → new_mkBalBranch6MkBalBranch339(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, bb, bc)
new_mkBalBranch6MkBalBranch1180(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Neg(Zero), Neg(wvu28030), bb, bc) → new_mkBalBranch6MkBalBranch1184(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, new_primMulNat1(wvu28030), bb, bc)
new_mkBalBranch6MkBalBranch0149(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch0113(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch0136(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Pos(Succ(wvu268000)), Pos(wvu26810), bh, ca) → new_mkBalBranch6MkBalBranch0134(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, wvu268000, new_primMulNat1(wvu26810), bh, ca)
new_mkBalBranch6MkBalBranch1164(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu2706000), Zero, h, ba) → new_mkBalBranch6MkBalBranch1113(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch1149(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba) → new_mkBalBranch6MkBalBranch1159(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch390(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Pos(Succ(wvu178200)), h, ba) → new_mkBalBranch6MkBalBranch391(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178200, new_mkBalBranch6Size_r2(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch392(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178200, Pos(wvu22090), h, ba) → new_mkBalBranch6MkBalBranch376(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178200, new_primMulNat(wvu22090), h, ba)
new_mkBalBranch6MkBalBranch350(wvu1487, wvu1488, wvu1693, wvu1692, Pos(wvu20950), h, ba) → new_mkBalBranch6MkBalBranch371(wvu1487, wvu1488, wvu1693, wvu1692, new_primMulNat(wvu20950), h, ba)
new_mkBalBranch6MkBalBranch397(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Zero, bb, bc) → new_mkBalBranch6MkBalBranch339(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, bb, bc)
new_mkBalBranch6MkBalBranch0148(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu182300, Zero, h, ba) → new_mkBalBranch6MkBalBranch0111(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch370(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu23410), h, ba) → new_mkBalBranch6MkBalBranch383(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu23410, Zero, h, ba)
new_mkBalBranch6MkBalBranch411(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, bb, bc) → new_mkBalBranch6MkBalBranch316(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, new_mkBalBranch6Size_l(wvu2748, wvu2749, Branch(wvu2750, wvu2751, Pos(Succ(wvu2752)), wvu2753, wvu2754), wvu2755, bb, bc), bb, bc)
new_mkBalBranch6MkBalBranch1139(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Neg(Succ(wvu267300)), Neg(wvu26740), h, ba) → new_mkBalBranch6MkBalBranch1145(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu267300, new_primMulNat1(wvu26740), h, ba)
new_mkBalBranch6MkBalBranch322(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu177800, wvu2248, h, ba) → new_mkBalBranch6MkBalBranch396(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu2248, wvu177800, h, ba)
new_mkBalBranch6MkBalBranch338(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu23400), h, ba) → new_mkBalBranch6MkBalBranch315(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch310(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu277500, wvu2793, bb, bc) → new_mkBalBranch6MkBalBranch395(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu2793, wvu277500, bb, bc)
new_mkBalBranch6MkBalBranch1180(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Pos(Succ(wvu280200)), Neg(wvu28030), bb, bc) → new_mkBalBranch6MkBalBranch1162(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, wvu280200, new_primMulNat1(wvu28030), bb, bc)
new_mkBalBranch6MkBalBranch391(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178200, Neg(wvu22070), h, ba) → new_mkBalBranch6MkBalBranch3102(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178200, new_primMulNat(wvu22070), h, ba)
new_mkBalBranch6MkBalBranch1133(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, bb, bc) → new_mkBalBranch6MkBalBranch1157(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, bb, bc)
new_mkBalBranch6MkBalBranch371(wvu1487, wvu1488, wvu1693, wvu1692, Succ(wvu21970), h, ba) → new_mkBalBranch6MkBalBranch372(wvu1487, wvu1488, wvu1693, wvu1692, Zero, wvu21970, h, ba)
new_mkBalBranch6MkBalBranch0123(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBranch(Succ(Succ(Zero)), wvu14910, wvu14911, new_mkBranch(Succ(Succ(Succ(Zero))), wvu1487, wvu1488, wvu1692, wvu14913, h, ba), wvu14914, h, ba)
new_mkBalBranch6MkBalBranch1130(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Neg(Zero), Pos(wvu27070), h, ba) → new_mkBalBranch6MkBalBranch1174(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, new_primMulNat1(wvu27070), h, ba)
new_mkBalBranch6MkBalBranch1137(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Zero, Zero, bb, bc) → new_mkBalBranch6MkBalBranch1133(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, bb, bc)
new_mkBalBranch6MkBalBranch0159(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu182300, wvu2424, h, ba) → new_mkBalBranch6MkBalBranch0112(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch374(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Neg(Succ(wvu177800)), h, ba) → new_mkBalBranch6MkBalBranch320(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu177800, new_mkBalBranch6Size_r1(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch115(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu2682000), Succ(wvu277100), h, ba) → new_mkBalBranch6MkBalBranch115(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu2682000, wvu277100, h, ba)
new_mkBalBranch6MkBalBranch014(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Pos(Succ(wvu178300)), Neg(wvu17840), h, ba) → new_mkBalBranch6MkBalBranch018(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch325(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, Branch(wvu16920, wvu16921, wvu16922, wvu16923, wvu16924), h, ba) → new_mkBalBranch6MkBalBranch1130(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, new_sizeFM(wvu16924, h, ba), new_sizeFM(wvu16923, h, ba), h, ba)
new_mkBalBranch6MkBalBranch1170(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu270600, Zero, h, ba) → new_mkBalBranch6MkBalBranch1113(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch017(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu23970), h, ba) → new_mkBalBranch6MkBalBranch018(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch317(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu277500, Neg(wvu27830), bb, bc) → new_mkBalBranch6MkBalBranch387(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu277500, new_primMulNat(wvu27830), bb, bc)
new_mkBalBranch6MkBalBranch0142(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Succ(wvu27330), bh, ca) → new_mkBalBranch6MkBalBranch0128(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, bh, ca)
new_mkBalBranch6MkBalBranch356(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Neg(wvu22080), h, ba) → new_mkBalBranch6MkBalBranch358(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat(wvu22080), h, ba)
new_mkBalBranch6MkBalBranch364(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178100, Neg(wvu22050), h, ba) → new_mkBalBranch6MkBalBranch365(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178100, new_primMulNat(wvu22050), h, ba)
new_mkBalBranch6MkBalBranch1110(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu270600, wvu2822, h, ba) → new_mkBalBranch6MkBalBranch1111(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch324(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, Succ(wvu234200), h, ba) → new_mkBalBranch6MkBalBranch342(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_primPlusNat0(Zero, Zero) → Zero
new_mkBalBranch6MkBalBranch014(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Neg(Succ(wvu178300)), Pos(wvu17840), h, ba) → new_mkBalBranch6MkBalBranch0123(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch0130(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Neg(Zero), Pos(wvu17900), h, ba) → new_mkBalBranch6MkBalBranch0118(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat1(wvu17900), h, ba)
new_mkBalBranch6MkBalBranch3101(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Succ(wvu2775000), Succ(wvu278800), bb, bc) → new_mkBalBranch6MkBalBranch3101(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu2775000, wvu278800, bb, bc)
new_mkBalBranch6Size_r0(wvu1487, wvu1488, wvu1693, h, ba) → new_sizeFM(EmptyFM, h, ba)
new_mkBalBranch6MkBalBranch365(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178100, wvu2339, h, ba) → new_mkBalBranch6MkBalBranch354(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu2339, wvu178100, h, ba)
new_mkBalBranch6MkBalBranch360(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu177800, wvu2243, h, ba) → new_mkBalBranch6MkBalBranch388(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu177800, wvu2243, h, ba)
new_mkBalBranch6MkBalBranch336(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu23370), h, ba) → new_mkBalBranch6MkBalBranch329(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch326(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, bb, bc) → new_mkBalBranch6MkBalBranch340(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, bb, bc)
new_mkBalBranch6MkBalBranch0157(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Zero, wvu268000, bh, ca) → new_mkBalBranch6MkBalBranch0128(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, bh, ca)
new_mkBalBranch6MkBalBranch1139(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Neg(Zero), Neg(wvu26740), h, ba) → new_mkBalBranch6MkBalBranch1147(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, new_primMulNat1(wvu26740), h, ba)
new_mkBalBranch6MkBalBranch1135(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba) → new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero))))))), wvu16920, wvu16921, wvu16923, new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero)))))))), wvu1487, wvu1488, wvu16924, Branch(wvu14910, wvu14911, Pos(Zero), wvu14913, wvu14914), h, ba), h, ba)
new_mkBalBranch6MkBalBranch0155(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu24010), h, ba) → new_mkBalBranch6MkBalBranch0153(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu24010, Zero, h, ba)
new_mkBalBranch6MkBalBranch349(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch367(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch316(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Neg(Zero), bb, bc) → new_mkBalBranch6MkBalBranch319(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, new_mkBalBranch6Size_r(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, bb, bc), bb, bc)
new_mkBalBranch6MkBalBranch1168(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Pos(Zero), Pos(wvu26950), h, ba) → new_mkBalBranch6MkBalBranch1165(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, new_primMulNat1(wvu26950), h, ba)
new_mkBalBranch6MkBalBranch313(wvu1487, wvu1488, wvu1693, wvu1692, wvu177100, Zero, h, ba) → new_mkBalBranch6MkBalBranch331(wvu1487, wvu1488, wvu1693, wvu1692, h, ba)
new_sizeFM(Branch(wvu16920, wvu16921, wvu16922, wvu16923, wvu16924), h, ba) → wvu16922
new_mkBalBranch6MkBalBranch0136(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Neg(Zero), Pos(wvu26810), bh, ca) → new_mkBalBranch6MkBalBranch0142(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, new_primMulNat1(wvu26810), bh, ca)
new_mkBalBranch6MkBalBranch0130(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Pos(Zero), Neg(wvu17900), h, ba) → new_mkBalBranch6MkBalBranch0124(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat1(wvu17900), h, ba)
new_mkBalBranch6MkBalBranch324(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, Zero, h, ba) → new_mkBalBranch6MkBalBranch335(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch375(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Neg(Zero), h, ba) → new_mkBalBranch6MkBalBranch369(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_mkBalBranch6Size_r3(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch1160(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu269400, wvu2814, h, ba) → new_mkBalBranch6MkBalBranch1135(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch0146(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu182300, wvu2410, h, ba) → new_mkBalBranch6MkBalBranch0111(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch319(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Pos(wvu27860), bb, bc) → new_mkBalBranch6MkBalBranch397(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, new_primMulNat(wvu27860), bb, bc)
new_mkBalBranch6MkBalBranch320(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu177800, Neg(wvu21630), h, ba) → new_mkBalBranch6MkBalBranch322(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu177800, new_primMulNat(wvu21630), h, ba)
new_mkBalBranch6MkBalBranch1169(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, h, ba) → new_mkBalBranch6MkBalBranch1155(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch0116(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu24050), wvu178900, h, ba) → new_mkBalBranch6MkBalBranch0151(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu24050, wvu178900, h, ba)
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_mkBalBranch6MkBalBranch50(wvu1487, wvu1488, wvu1491, wvu1693, wvu1692, Pos(Succ(Succ(Zero))), h, ba) → new_mkBalBranch6MkBalBranch51(wvu1487, wvu1488, wvu1491, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1176(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu269400, wvu2810, h, ba) → new_mkBalBranch6MkBalBranch1179(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu269400, wvu2810, h, ba)
new_mkBalBranch6MkBalBranch337(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch311(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch358(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch335(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch0130(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Neg(Succ(wvu178900)), Pos(wvu17900), h, ba) → new_mkBalBranch6MkBalBranch0119(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch363(wvu1487, wvu1488, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch333(wvu1487, wvu1488, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch50(wvu1487, wvu1488, wvu1491, wvu1693, wvu1692, Neg(Succ(wvu169400)), h, ba) → new_mkBalBranch6MkBalBranch52(wvu1487, wvu1488, wvu1491, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch351(wvu1487, wvu1488, wvu1693, wvu1692, wvu177100, Neg(wvu20960), h, ba) → new_mkBalBranch6MkBalBranch381(wvu1487, wvu1488, wvu1693, wvu1692, wvu177100, new_primMulNat(wvu20960), h, ba)
new_mkBalBranch6MkBalBranch368(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, wvu178200, h, ba) → new_mkBalBranch6MkBalBranch342(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch420(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch375(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_mkBalBranch6Size_l1(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch1168(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Neg(Zero), Pos(wvu26950), h, ba) → new_mkBalBranch6MkBalBranch1138(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, new_primMulNat1(wvu26950), h, ba)
new_mkBalBranch6MkBalBranch1179(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu269400, Succ(wvu28100), h, ba) → new_mkBalBranch6MkBalBranch1134(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu269400, wvu28100, h, ba)
new_mkBalBranch6MkBalBranch0143(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Zero, bh, ca) → new_mkBalBranch6MkBalBranch0129(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, bh, ca)
new_mkBalBranch6MkBalBranch1117(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, wvu280200, wvu2839, bb, bc) → new_mkBalBranch6MkBalBranch1118(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, wvu2839, wvu280200, bb, bc)
new_mkBalBranch6MkBalBranch1146(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, h, ba) → new_mkBalBranch6MkBalBranch1150(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch0115(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch0117(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch379(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch349(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1177(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, h, ba) → new_mkBalBranch6MkBalBranch1136(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch1178(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu28170), h, ba) → new_mkBalBranch6MkBalBranch1179(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu28170, Zero, h, ba)
new_mkBalBranch6MkBalBranch367(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBranch(Succ(Zero), wvu1487, wvu1488, wvu1692, Branch(wvu14910, wvu14911, Neg(Succ(wvu1491200)), wvu14913, wvu14914), h, ba)
new_ps(wvu1487, wvu1488, wvu1491, wvu1826, wvu1825, h, ba) → new_primPlusInt2(new_mkBalBranch6Size_l(wvu1487, wvu1488, wvu1491, wvu1826, h, ba), wvu1487, wvu1488, wvu1491, wvu1825, h, ba)
new_mkBalBranch6MkBalBranch1180(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Neg(Succ(wvu280200)), Neg(wvu28030), bb, bc) → new_mkBalBranch6MkBalBranch1117(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, wvu280200, new_primMulNat1(wvu28030), bb, bc)
new_mkBalBranch6MkBalBranch335(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch389(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch355(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1781000), Zero, h, ba) → new_mkBalBranch6MkBalBranch329(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch0157(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Succ(wvu27320), wvu268000, bh, ca) → new_mkBalBranch6MkBalBranch0127(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, wvu27320, wvu268000, bh, ca)
new_mkBalBranch6MkBalBranch0136(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Pos(Succ(wvu268000)), Neg(wvu26810), bh, ca) → new_mkBalBranch6MkBalBranch0137(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, wvu268000, new_primMulNat1(wvu26810), bh, ca)
new_mkBalBranch6MkBalBranch399(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu23360), h, ba) → new_mkBalBranch6MkBalBranch354(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, wvu23360, h, ba)
new_mkBalBranch6MkBalBranch314(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178100, wvu2338, h, ba) → new_mkBalBranch6MkBalBranch315(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6Size_l4(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, h, ba) → new_sizeFM(wvu1693, h, ba)
new_mkBalBranch6MkBalBranch375(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Neg(Succ(wvu178100)), h, ba) → new_mkBalBranch6MkBalBranch364(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178100, new_mkBalBranch6Size_r3(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch317(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu277500, Pos(wvu27830), bb, bc) → new_mkBalBranch6MkBalBranch36(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu277500, new_primMulNat(wvu27830), bb, bc)
new_mkBalBranch6MkBalBranch0113(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch0114(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch014(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Neg(Succ(wvu178300)), Neg(wvu17840), h, ba) → new_mkBalBranch6MkBalBranch0145(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat1(wvu17840), wvu178300, h, ba)
new_mkBalBranch6MkBalBranch0126(wvu1487, wvu1488, wvu14910, wvu14911, Branch(wvu149130, wvu149131, wvu149132, wvu149133, wvu149134), wvu14914, wvu1693, wvu1692, h, ba) → new_mkBranch(Succ(Succ(Succ(Succ(Zero)))), wvu149130, wvu149131, new_mkBranch(Succ(Succ(Succ(Succ(Succ(Zero))))), wvu1487, wvu1488, wvu1692, wvu149133, h, ba), new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Zero)))))), wvu14910, wvu14911, wvu149134, wvu14914, h, ba), h, ba)
new_mkBalBranch6MkBalBranch51(wvu1487, wvu1488, EmptyFM, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch427(wvu1487, wvu1488, wvu1693, wvu1692, new_mkBalBranch6Size_l0(wvu1487, wvu1488, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch0144(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch019(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1151(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu267300, Succ(wvu27370), h, ba) → new_mkBalBranch6MkBalBranch1152(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu267300, wvu27370, h, ba)
new_mkBalBranch6MkBalBranch359(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu177800, Neg(wvu21610), h, ba) → new_mkBalBranch6MkBalBranch361(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu177800, new_primMulNat(wvu21610), h, ba)
new_mkBalBranch6MkBalBranch1161(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Succ(wvu28400), bb, bc) → new_mkBalBranch6MkBalBranch1128(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, bb, bc)
new_mkBalBranch6MkBalBranch347(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu22460), h, ba) → new_mkBalBranch6MkBalBranch348(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1119(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, h, ba) → new_mkBalBranch6MkBalBranch118(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch381(wvu1487, wvu1488, wvu1693, wvu1692, wvu177100, wvu2200, h, ba) → new_mkBalBranch6MkBalBranch372(wvu1487, wvu1488, wvu1693, wvu1692, wvu2200, wvu177100, h, ba)
new_mkBalBranch6MkBalBranch384(wvu1487, wvu1488, wvu1693, wvu1692, Succ(wvu21980), h, ba) → new_mkBalBranch6MkBalBranch331(wvu1487, wvu1488, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch0122(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1783000), Succ(wvu259000), h, ba) → new_mkBalBranch6MkBalBranch0122(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu1783000, wvu259000, h, ba)
new_mkBalBranch6MkBalBranch389(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBranch(Succ(Zero), wvu1487, wvu1488, wvu1692, Branch(wvu14910, wvu14911, Neg(Zero), wvu14913, wvu14914), h, ba)
new_mkBalBranch6MkBalBranch398(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Neg(wvu22040), h, ba) → new_mkBalBranch6MkBalBranch336(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat(wvu22040), h, ba)
new_mkBalBranch6MkBalBranch1130(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Neg(Succ(wvu270600)), Neg(wvu27070), h, ba) → new_mkBalBranch6MkBalBranch1167(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu270600, new_primMulNat1(wvu27070), h, ba)
new_mkBalBranch6MkBalBranch3103(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch335(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1152(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, Succ(wvu273700), h, ba) → new_mkBalBranch6MkBalBranch1158(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch353(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch367(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch015(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Pos(Zero), Pos(wvu18240), h, ba) → new_mkBalBranch6MkBalBranch0149(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat1(wvu18240), h, ba)
new_mkBalBranch6MkBalBranch3103(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu23480), h, ba) → new_mkBalBranch6MkBalBranch342(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch376(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178200, wvu2346, h, ba) → new_mkBalBranch6MkBalBranch342(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1154(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, h, ba) → new_mkBalBranch6MkBalBranch1155(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch0130(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Pos(Succ(wvu178900)), Pos(wvu17900), h, ba) → new_mkBalBranch6MkBalBranch0131(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178900, new_primMulNat1(wvu17900), h, ba)
new_mkBalBranch6Size_r1(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, h, ba) → new_sizeFM(Branch(wvu14910, wvu14911, Neg(Succ(wvu1491200)), wvu14913, wvu14914), h, ba)
new_mkBalBranch6MkBalBranch1143(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, h, ba) → new_mkBalBranch6MkBalBranch1150(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch1184(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Succ(wvu28410), bb, bc) → new_mkBalBranch6MkBalBranch1182(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, wvu28410, Zero, bb, bc)
new_mkBalBranch6MkBalBranch355(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, Succ(wvu233400), h, ba) → new_mkBalBranch6MkBalBranch315(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1159(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, Branch(wvu169240, wvu169241, wvu169242, wvu169243, wvu169244), h, ba) → new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero))))))))), wvu169240, wvu169241, new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero)))))))))), wvu16920, wvu16921, wvu16923, wvu169243, h, ba), new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero))))))))))), wvu1487, wvu1488, wvu169244, EmptyFM, h, ba), h, ba)
new_mkBalBranch6MkBalBranch0139(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Zero, bh, ca) → new_mkBalBranch6MkBalBranch0129(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, bh, ca)
new_mkBalBranch6MkBalBranch0124(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu26440), h, ba) → new_mkBalBranch6MkBalBranch0125(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch390(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Neg(Zero), h, ba) → new_mkBalBranch6MkBalBranch393(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_mkBalBranch6Size_r2(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch417(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Neg(wvu17540), h, ba) → new_mkBalBranch6MkBalBranch418(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat(wvu17540), h, ba)
new_mkBalBranch6MkBalBranch115(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu2682000), Zero, h, ba) → new_mkBalBranch6MkBalBranch116(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch345(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Neg(wvu21620), h, ba) → new_mkBalBranch6MkBalBranch347(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat(wvu21620), h, ba)
new_mkBalBranch6MkBalBranch425(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Zero, Succ(wvu27580), bb, bc) → new_mkBalBranch6MkBalBranch411(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, bb, bc)
new_primMinusNat0(Zero, Succ(wvu5200)) → Neg(Succ(wvu5200))
new_mkBalBranch6MkBalBranch324(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1782000), Zero, h, ba) → new_mkBalBranch6MkBalBranch325(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch374(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Pos(Succ(wvu177800)), h, ba) → new_mkBalBranch6MkBalBranch359(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu177800, new_mkBalBranch6Size_r1(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch316(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Pos(Zero), bb, bc) → new_mkBalBranch6MkBalBranch318(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, new_mkBalBranch6Size_r(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, bb, bc), bb, bc)
new_mkBalBranch6MkBalBranch0131(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178900, Zero, h, ba) → new_mkBalBranch6MkBalBranch0125(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch016(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, EmptyFM, wvu14914, wvu1693, wvu1692, h, ba) → error([])
new_mkBalBranch6MkBalBranch0133(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu24230), h, ba) → new_mkBalBranch6MkBalBranch0111(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch330(wvu1487, wvu1488, wvu1693, wvu1692, Succ(wvu1771000), Succ(wvu219500), h, ba) → new_mkBalBranch6MkBalBranch330(wvu1487, wvu1488, wvu1693, wvu1692, wvu1771000, wvu219500, h, ba)
new_mkBalBranch6MkBalBranch1153(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, Branch(wvu169240, wvu169241, wvu169242, wvu169243, wvu169244), h, ba) → new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero))))))))), wvu169240, wvu169241, new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero)))))))))), wvu16920, wvu16921, wvu16923, wvu169243, h, ba), new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero))))))))))), wvu1487, wvu1488, wvu169244, Branch(wvu14910, wvu14911, Pos(Zero), wvu14913, wvu14914), h, ba), h, ba)
new_mkBalBranch6MkBalBranch0156(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch0113(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch323(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178200, Zero, h, ba) → new_mkBalBranch6MkBalBranch325(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch384(wvu1487, wvu1488, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch333(wvu1487, wvu1488, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch0130(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Neg(Succ(wvu178900)), Neg(wvu17900), h, ba) → new_mkBalBranch6MkBalBranch0116(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat1(wvu17900), wvu178900, h, ba)
new_mkBalBranch6MkBalBranch352(wvu1487, wvu1488, wvu1693, wvu1692, Pos(wvu20970), h, ba) → new_mkBalBranch6MkBalBranch362(wvu1487, wvu1488, wvu1693, wvu1692, new_primMulNat(wvu20970), h, ba)
new_mkBalBranch6MkBalBranch1126(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu27780), h, ba) → new_mkBalBranch6MkBalBranch117(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch0131(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178900, Succ(wvu24030), h, ba) → new_mkBalBranch6MkBalBranch0151(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178900, wvu24030, h, ba)
new_mkBalBranch6MkBalBranch426(wvu1487, wvu1488, wvu1693, wvu1692, Succ(wvu17580), h, ba) → new_mkBalBranch6MkBalBranch49(wvu1487, wvu1488, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1129(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu27770), wvu268200, h, ba) → new_mkBalBranch6MkBalBranch115(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu27770, wvu268200, h, ba)
new_mkBalBranch6MkBalBranch429(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu1760, h, ba) → new_mkBalBranch6MkBalBranch425(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1491200), wvu1760, h, ba)
new_mkBalBranch6MkBalBranch1180(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Pos(Succ(wvu280200)), Pos(wvu28030), bb, bc) → new_mkBalBranch6MkBalBranch1183(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, wvu280200, new_primMulNat1(wvu28030), bb, bc)
new_mkBalBranch6MkBalBranch421(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch419(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch354(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, wvu178100, h, ba) → new_mkBalBranch6MkBalBranch315(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_primPlusInt2(Neg(wvu18430), wvu1487, wvu1488, wvu1491, wvu1825, h, ba) → new_primPlusInt1(wvu18430, new_sizeFM(wvu1491, h, ba))
new_mkBalBranch6MkBalBranch0124(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch0117(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1166(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, wvu269400, h, ba) → new_mkBalBranch6MkBalBranch1135(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch0153(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu178300, Zero, h, ba) → new_mkBalBranch6MkBalBranch018(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch51(wvu1487, wvu1488, Branch(wvu14910, wvu14911, Pos(Succ(wvu1491200)), wvu14913, wvu14914), wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch428(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, new_mkBalBranch6Size_l3(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch316(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Pos(Succ(wvu277500)), bb, bc) → new_mkBalBranch6MkBalBranch317(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu277500, new_mkBalBranch6Size_r(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, bb, bc), bb, bc)
new_mkBalBranch6MkBalBranch344(wvu1487, wvu1488, wvu1693, wvu1692, wvu177100, wvu2196, h, ba) → new_mkBalBranch6MkBalBranch331(wvu1487, wvu1488, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1130(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Pos(Zero), Pos(wvu27070), h, ba) → new_mkBalBranch6MkBalBranch1181(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, new_primMulNat1(wvu27070), h, ba)
new_mkBalBranch6MkBalBranch328(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178100, wvu2335, h, ba) → new_mkBalBranch6MkBalBranch329(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1134(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu2694000), Succ(wvu281000), h, ba) → new_mkBalBranch6MkBalBranch1134(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu2694000, wvu281000, h, ba)
new_mkBalBranch6MkBalBranch0134(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, wvu268000, wvu2727, bh, ca) → new_mkBalBranch6MkBalBranch0135(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, wvu268000, wvu2727, bh, ca)
new_mkBalBranch6MkBalBranch428(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Pos(wvu17520), h, ba) → new_mkBalBranch6MkBalBranch429(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat(wvu17520), h, ba)
new_mkBalBranch6Size_l1(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, h, ba) → new_sizeFM(wvu1693, h, ba)
new_mkBalBranch6MkBalBranch375(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Pos(Zero), h, ba) → new_mkBalBranch6MkBalBranch398(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_mkBalBranch6Size_r3(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch390(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Pos(Zero), h, ba) → new_mkBalBranch6MkBalBranch356(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_mkBalBranch6Size_r2(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch319(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Neg(wvu27860), bb, bc) → new_mkBalBranch6MkBalBranch341(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, new_primMulNat(wvu27860), bb, bc)
new_mkBalBranch6MkBalBranch50(wvu1487, wvu1488, wvu1491, wvu1693, wvu1692, Neg(Zero), h, ba) → new_mkBalBranch6MkBalBranch52(wvu1487, wvu1488, wvu1491, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch417(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Pos(wvu17540), h, ba) → new_mkBalBranch6MkBalBranch412(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat(wvu17540), h, ba)
new_mkBalBranch6MkBalBranch51(wvu1487, wvu1488, Branch(wvu14910, wvu14911, Neg(Zero), wvu14913, wvu14914), wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch422(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_mkBalBranch6Size_l4(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch39(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu277500, wvu2792, bb, bc) → new_mkBalBranch6MkBalBranch326(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, bb, bc)
new_primPlusNat0(Succ(wvu33200), Succ(wvu5200)) → Succ(Succ(new_primPlusNat0(wvu33200, wvu5200)))
new_mkBalBranch6MkBalBranch0136(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Neg(Zero), Neg(wvu26810), bh, ca) → new_mkBalBranch6MkBalBranch0143(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, new_primMulNat1(wvu26810), bh, ca)
new_mkBalBranch6MkBalBranch1152(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu2673000), Succ(wvu273700), h, ba) → new_mkBalBranch6MkBalBranch1152(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu2673000, wvu273700, h, ba)
new_mkBalBranch6MkBalBranch1138(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu28160), h, ba) → new_mkBalBranch6MkBalBranch1135(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch333(wvu1487, wvu1488, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch380(wvu1487, wvu1488, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch48(wvu2760, wvu2761, wvu2762, wvu2763, wvu2764, wvu2765, wvu2766, wvu2767, wvu2768, Succ(wvu27690), Zero, bf, bg) → new_mkBalBranch6MkBalBranch0(wvu2760, wvu2761, wvu2762, wvu2763, wvu2764, wvu2765, wvu2766, wvu2767, wvu2768, bf, bg)
new_mkBalBranch6MkBalBranch327(wvu1487, wvu1488, wvu1693, wvu1692, Pos(Zero), h, ba) → new_mkBalBranch6MkBalBranch350(wvu1487, wvu1488, wvu1693, wvu1692, new_mkBalBranch6Size_r0(wvu1487, wvu1488, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch392(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178200, Neg(wvu22090), h, ba) → new_mkBalBranch6MkBalBranch3104(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178200, new_primMulNat(wvu22090), h, ba)
new_mkBalBranch6MkBalBranch0110(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, Zero, h, ba) → new_mkBalBranch6MkBalBranch0113(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch0140(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, wvu268000, wvu2731, bh, ca) → new_mkBalBranch6MkBalBranch0128(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, bh, ca)
new_mkBalBranch6MkBalBranch427(wvu1487, wvu1488, wvu1693, wvu1692, Neg(wvu17490), h, ba) → new_mkBalBranch6MkBalBranch413(wvu1487, wvu1488, wvu1693, wvu1692, new_primMulNat(wvu17490), h, ba)
new_mkBalBranch6MkBalBranch1118(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Zero, wvu280200, bb, bc) → new_mkBalBranch6MkBalBranch1128(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, bb, bc)
new_mkBalBranch6MkBalBranch396(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Zero, wvu177800, h, ba) → new_mkBalBranch6MkBalBranch353(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch0130(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Pos(Succ(wvu178900)), Neg(wvu17900), h, ba) → new_mkBalBranch6MkBalBranch0125(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1123(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, h, ba) → new_mkBalBranch6MkBalBranch118(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch422(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Pos(wvu17550), h, ba) → new_mkBalBranch6MkBalBranch414(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat(wvu17550), h, ba)
new_mkBalBranch6MkBalBranch015(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Pos(Zero), Neg(wvu18240), h, ba) → new_mkBalBranch6MkBalBranch0133(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat1(wvu18240), h, ba)
new_mkBalBranch6MkBalBranch1164(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Zero, Zero, h, ba) → new_mkBalBranch6MkBalBranch1155(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch375(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Pos(Succ(wvu178100)), h, ba) → new_mkBalBranch6MkBalBranch3100(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178100, new_mkBalBranch6Size_r3(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch0110(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1823000), Zero, h, ba) → new_mkBalBranch6MkBalBranch0111(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch0143(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, Succ(wvu27340), bh, ca) → new_mkBalBranch6MkBalBranch0135(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, wvu2669, wvu2670, wvu2671, wvu2672, wvu27340, Zero, bh, ca)
new_mkBalBranch6MkBalBranch312(wvu1487, wvu1488, wvu1693, wvu1692, wvu177100, wvu2195, h, ba) → new_mkBalBranch6MkBalBranch313(wvu1487, wvu1488, wvu1693, wvu1692, wvu177100, wvu2195, h, ba)
new_mkBalBranch6MkBalBranch37(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, wvu277500, Zero, bb, bc) → new_mkBalBranch6MkBalBranch386(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, bb, bc)
new_mkBalBranch6MkBalBranch369(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Neg(wvu22060), h, ba) → new_mkBalBranch6MkBalBranch370(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat(wvu22060), h, ba)
new_mkBalBranch6MkBalBranch414(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch45(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6Size_r2(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, h, ba) → new_sizeFM(Branch(wvu14910, wvu14911, Neg(Zero), wvu14913, wvu14914), h, ba)
new_mkBalBranch6MkBalBranch0158(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu182300, wvu2425, h, ba) → new_mkBalBranch6MkBalBranch0150(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu2425, wvu182300, h, ba)
new_mkBalBranch6MkBalBranch0130(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Neg(Zero), Neg(wvu17900), h, ba) → new_mkBalBranch6MkBalBranch0132(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat1(wvu17900), h, ba)
new_mkBalBranch6MkBalBranch3100(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178100, Pos(wvu22030), h, ba) → new_mkBalBranch6MkBalBranch382(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu178100, new_primMulNat(wvu22030), h, ba)
new_mkBalBranch6MkBalBranch1115(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba) → new_mkBalBranch6MkBalBranch1153(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch0110(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu1823000), Succ(wvu240600), h, ba) → new_mkBalBranch6MkBalBranch0110(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu1823000, wvu240600, h, ba)
new_mkBalBranch6MkBalBranch327(wvu1487, wvu1488, wvu1693, wvu1692, Neg(Succ(wvu177100)), h, ba) → new_mkBalBranch6MkBalBranch351(wvu1487, wvu1488, wvu1693, wvu1692, wvu177100, new_mkBalBranch6Size_r0(wvu1487, wvu1488, wvu1693, h, ba), h, ba)
new_mkBalBranch6MkBalBranch50(wvu1487, wvu1488, wvu1491, wvu1693, wvu1692, Pos(Succ(Zero)), h, ba) → new_mkBalBranch6MkBalBranch52(wvu1487, wvu1488, wvu1491, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch014(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, Pos(Zero), Pos(wvu17840), h, ba) → new_mkBalBranch6MkBalBranch0144(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat1(wvu17840), h, ba)
new_mkBalBranch6MkBalBranch45(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba) → new_mkBalBranch6MkBalBranch415(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch0149(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu24180), h, ba) → new_mkBalBranch6MkBalBranch0150(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, wvu24180, h, ba)
new_mkBalBranch6MkBalBranch1130(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Neg(Succ(wvu270600)), Pos(wvu27070), h, ba) → new_mkBalBranch6MkBalBranch1110(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu270600, new_primMulNat1(wvu27070), h, ba)
new_mkBalBranch6MkBalBranch015(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Neg(Succ(wvu182300)), Pos(wvu18240), h, ba) → new_mkBalBranch6MkBalBranch0159(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu182300, new_primMulNat1(wvu18240), h, ba)
new_mkBalBranch6MkBalBranch0114(wvu1487, wvu1488, wvu14910, wvu14911, EmptyFM, wvu14914, wvu1693, wvu1692, h, ba) → error([])
new_mkBalBranch6MkBalBranch388(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu177800, Succ(wvu22430), h, ba) → new_mkBalBranch6MkBalBranch366(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu1692, wvu177800, wvu22430, h, ba)
new_mkBalBranch6MkBalBranch372(wvu1487, wvu1488, wvu1693, wvu1692, Zero, wvu177100, h, ba) → new_mkBalBranch6MkBalBranch332(wvu1487, wvu1488, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1163(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu28230), wvu270600, h, ba) → new_mkBalBranch6MkBalBranch1164(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu28230, wvu270600, h, ba)
new_mkBalBranch6MkBalBranch338(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch337(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch0118(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu26460), h, ba) → new_mkBalBranch6MkBalBranch0119(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch1161(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Zero, bb, bc) → new_mkBalBranch6MkBalBranch1133(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, bb, bc)
new_mkBalBranch6MkBalBranch1119(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu27790), h, ba) → new_mkBalBranch6MkBalBranch119(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu27790, Zero, h, ba)
new_mkBalBranch6MkBalBranch425(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Succ(wvu27570), Zero, bb, bc) → new_mkBalBranch6MkBalBranch43(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, bb, bc)
new_mkBalBranch6MkBalBranch421(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu17620), h, ba) → new_mkBalBranch6MkBalBranch420(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch424(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu17630), h, ba) → new_mkBalBranch6MkBalBranch0130(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_sizeFM(wvu14913, h, ba), new_sizeFM(wvu14914, h, ba), h, ba)
new_mkBalBranch6MkBalBranch016(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, Branch(wvu149130, wvu149131, wvu149132, wvu149133, wvu149134), wvu14914, wvu1693, wvu1692, h, ba) → new_mkBranch(Succ(Succ(Succ(Succ(Zero)))), wvu149130, wvu149131, new_mkBranch(Succ(Succ(Succ(Succ(Succ(Zero))))), wvu1487, wvu1488, wvu1692, wvu149133, h, ba), new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Zero)))))), wvu14910, wvu14911, wvu149134, wvu14914, h, ba), h, ba)
new_mkBalBranch6MkBalBranch1113(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba) → new_mkBalBranch6MkBalBranch1175(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch318(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, Pos(wvu27840), bb, bc) → new_mkBalBranch6MkBalBranch394(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu2756, new_primMulNat(wvu27840), bb, bc)
new_mkBalBranch6MkBalBranch354(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Succ(wvu23390), wvu178100, h, ba) → new_mkBalBranch6MkBalBranch355(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, wvu23390, wvu178100, h, ba)
new_mkBalBranch6MkBalBranch1147(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu27460), h, ba) → new_mkBalBranch6MkBalBranch1151(wvu1487, wvu1488, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu27460, Zero, h, ba)
new_mkBalBranch6MkBalBranch1120(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Pos(Succ(wvu268200)), Neg(wvu26830), h, ba) → new_mkBalBranch6MkBalBranch1121(wvu1487, wvu1488, wvu14910, wvu14911, wvu1491200, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, wvu268200, new_primMulNat1(wvu26830), h, ba)
new_mkBalBranch6MkBalBranch371(wvu1487, wvu1488, wvu1693, wvu1692, Zero, h, ba) → new_mkBalBranch6MkBalBranch333(wvu1487, wvu1488, wvu1693, wvu1692, h, ba)
new_deleteMax0(wvu14960, wvu14961, wvu14962, wvu14963, EmptyFM, h, ba) → wvu14963
new_mkBalBranch6MkBalBranch0151(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Zero, Zero, h, ba) → new_mkBalBranch6MkBalBranch0117(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, h, ba)
new_mkBalBranch6MkBalBranch0121(wvu2664, wvu2665, wvu2666, wvu2667, wvu2668, EmptyFM, wvu2670, wvu2671, wvu2672, bh, ca) → error([])
new_mkBalBranch6MkBalBranch1134(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, Succ(wvu2694000), Zero, h, ba) → new_mkBalBranch6MkBalBranch1115(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu16920, wvu16921, wvu16922, wvu16923, wvu16924, h, ba)
new_mkBalBranch6MkBalBranch1180(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Pos(Zero), Neg(wvu28030), bb, bc) → new_mkBalBranch6MkBalBranch1131(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, new_primMulNat1(wvu28030), bb, bc)
new_mkBalBranch6MkBalBranch398(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, Pos(wvu22040), h, ba) → new_mkBalBranch6MkBalBranch399(wvu1487, wvu1488, wvu14910, wvu14911, wvu14913, wvu14914, wvu1693, wvu1692, new_primMulNat(wvu22040), h, ba)
new_primMinusNat0(Succ(wvu33200), Succ(wvu5200)) → new_primMinusNat0(wvu33200, wvu5200)
new_mkBalBranch6MkBalBranch1118(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, Succ(wvu28390), wvu280200, bb, bc) → new_mkBalBranch6MkBalBranch1137(wvu2748, wvu2749, wvu2750, wvu2751, wvu2752, wvu2753, wvu2754, wvu2755, wvu27560, wvu27561, wvu27562, wvu27563, wvu27564, wvu28390, wvu280200, bb, bc)
new_primPlusInt(Neg(wvu27240), wvu2716, wvu2714, wvu2717, bd, be) → new_primPlusInt1(wvu27240, new_sizeFM(wvu2717, bd, be))
new_primMulNat1(Succ(wvu178400)) → new_primPlusNat0(new_primMulNat0(wvu178400), Succ(wvu178400))
The set Q consists of the following terms:
new_mkBalBranch6MkBalBranch344(x0, x1, x2, x3, x4, x5, x6, x7)
new_mkBalBranch6MkBalBranch51(x0, x1, Branch(x2, x3, Pos(Zero), x4, x5), x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch1122(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Zero, x13, x14)
new_mkBalBranch6MkBalBranch0136(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Zero), Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch0136(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Zero), Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch1166(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Succ(x12), x13, x14, x15)
new_mkBalBranch6MkBalBranch336(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch6Size_l1(x0, x1, x2, x3, x4, x5, x6, x7, x8)
new_mkBalBranch6MkBalBranch425(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch0149(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch1169(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Zero, x12, x13)
new_mkBalBranch6MkBalBranch0(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch1165(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Succ(x12), x13, x14)
new_mkBalBranch6MkBalBranch50(x0, x1, x2, x3, x4, Pos(Succ(Succ(Succ(x5)))), x6, x7)
new_mkBalBranch6MkBalBranch368(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10, x11)
new_primMinusNat0(Zero, Zero)
new_mkBalBranch6MkBalBranch1168(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Pos(Succ(x12)), Pos(x13), x14, x15)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, Neg(Zero), Neg(x8), x9, x10)
new_mkBalBranch6MkBalBranch1127(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16)
new_mkBalBranch6MkBalBranch3105(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11)
new_mkBalBranch6MkBalBranch1178(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Zero, x12, x13)
new_primPlusInt0(x0, Neg(x1))
new_mkBalBranch6MkBalBranch0130(x0, x1, x2, x3, x4, x5, x6, x7, Neg(Succ(x8)), Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch411(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch0157(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10, x11)
new_mkBalBranch6MkBalBranch1180(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Pos(Zero), Pos(x13), x14, x15)
new_mkBalBranch6MkBalBranch1139(x0, x1, x2, x3, x4, x5, x6, x7, Neg(Zero), Pos(x8), x9, x10)
new_mkBalBranch6MkBalBranch1139(x0, x1, x2, x3, x4, x5, x6, x7, Pos(Zero), Neg(x8), x9, x10)
new_mkBalBranch6MkBalBranch0116(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10, x11)
new_mkBalBranch6MkBalBranch346(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch0122(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), Succ(x10), x11, x12)
new_mkBalBranch6MkBalBranch320(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Neg(x10), x11, x12)
new_mkBalBranch6MkBalBranch367(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch1180(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Pos(Succ(x13)), Pos(x14), x15, x16)
new_mkBalBranch6MkBalBranch1161(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Succ(x13), x14, x15)
new_mkBalBranch6MkBalBranch1163(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Zero, x12, x13, x14)
new_mkBalBranch6MkBalBranch363(x0, x1, x2, x3, Succ(x4), x5, x6)
new_mkBalBranch6MkBalBranch0148(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch375(x0, x1, x2, x3, x4, x5, x6, x7, Neg(Succ(x8)), x9, x10)
new_mkBalBranch6MkBalBranch394(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch399(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_mkBalBranch6MkBalBranch016(x0, x1, x2, x3, x4, Branch(x5, x6, x7, x8, x9), x10, x11, x12, x13, x14)
new_mkBalBranch6MkBalBranch0128(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch1123(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Succ(x13), x14, x15)
new_mkBalBranch6MkBalBranch321(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12)
new_mkBalBranch6MkBalBranch0131(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch1175(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, EmptyFM, x11, x12)
new_mkBalBranch6MkBalBranch1128(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14)
new_mkBalBranch6MkBalBranch1147(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_mkBalBranch6MkBalBranch38(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Neg(x10), x11, x12)
new_mkBalBranch6MkBalBranch330(x0, x1, x2, x3, Succ(x4), Zero, x5, x6)
new_primMinusNat0(Succ(x0), Succ(x1))
new_mkBalBranch6MkBalBranch428(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch330(x0, x1, x2, x3, Zero, Succ(x4), x5, x6)
new_mkBalBranch6MkBalBranch395(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10, x11)
new_mkBalBranch6MkBalBranch0136(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Succ(x9)), Pos(x10), x11, x12)
new_mkBalBranch6MkBalBranch339(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_primMulNat0(x0)
new_mkBalBranch6MkBalBranch410(x0, x1, x2, x3, x4, x5)
new_mkBalBranch6MkBalBranch0130(x0, x1, x2, x3, x4, x5, x6, x7, Pos(Succ(x8)), Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch0130(x0, x1, x2, x3, x4, x5, x6, x7, Neg(Succ(x8)), Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch0129(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch381(x0, x1, x2, x3, x4, x5, x6, x7)
new_mkBalBranch6MkBalBranch350(x0, x1, x2, x3, Neg(x4), x5, x6)
new_mkBalBranch6MkBalBranch345(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch1118(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Zero, x13, x14, x15)
new_mkBalBranch6MkBalBranch329(x0, x1, x2, x3, x4, x5, x6, EmptyFM, x7, x8)
new_mkBalBranch6MkBalBranch018(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_sizeFM(EmptyFM, x0, x1)
new_mkBalBranch6MkBalBranch1153(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, EmptyFM, x11, x12)
new_mkBalBranch6MkBalBranch327(x0, x1, x2, x3, Pos(Succ(x4)), x5, x6)
new_mkBalBranch6MkBalBranch355(x0, x1, x2, x3, x4, x5, x6, x7, Zero, Zero, x8, x9)
new_primPlusInt1(x0, Neg(x1))
new_mkBalBranch6MkBalBranch1181(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Succ(x12), x13, x14)
new_mkBalBranch6MkBalBranch314(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11)
new_primMulNat1(Zero)
new_mkBalBranch6MkBalBranch391(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch50(x0, x1, x2, x3, x4, Neg(Succ(x5)), x6, x7)
new_mkBalBranch6MkBalBranch319(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch1141(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11)
new_mkBalBranch6MkBalBranch46(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch1164(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Zero, Succ(x12), x13, x14)
new_mkBalBranch6MkBalBranch323(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch0151(x0, x1, x2, x3, x4, x5, x6, x7, Zero, Zero, x8, x9)
new_mkBalBranch6MkBalBranch0142(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch1152(x0, x1, x2, x3, x4, x5, x6, x7, Zero, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch1134(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Zero, Zero, x12, x13)
new_mkBalBranch6MkBalBranch1174(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Zero, x12, x13)
new_mkBalBranch6MkBalBranch019(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch384(x0, x1, x2, x3, Zero, x4, x5)
new_mkBalBranch6MkBalBranch1130(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Neg(Succ(x12)), Neg(x13), x14, x15)
new_mkBalBranch6MkBalBranch341(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch369(x0, x1, x2, x3, x4, x5, x6, x7, Pos(x8), x9, x10)
new_mkBalBranch6MkBalBranch48(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch3102(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11)
new_mkBalBranch6MkBalBranch429(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11)
new_mkBalBranch6MkBalBranch014(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Zero), Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch1148(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, EmptyFM, x12, x13)
new_mkBalBranch6MkBalBranch392(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch1177(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Zero, x12, x13)
new_mkBalBranch6MkBalBranch364(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch0121(x0, x1, x2, x3, x4, Branch(x5, x6, x7, x8, x9), x10, x11, x12, x13, x14)
new_mkBalBranch6MkBalBranch1182(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, Succ(x14), x15, x16)
new_mkBalBranch6MkBalBranch0130(x0, x1, x2, x3, x4, x5, x6, x7, Pos(Zero), Neg(x8), x9, x10)
new_mkBalBranch6MkBalBranch0130(x0, x1, x2, x3, x4, x5, x6, x7, Neg(Zero), Pos(x8), x9, x10)
new_mkBranch(x0, x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch0130(x0, x1, x2, x3, x4, x5, x6, x7, Pos(Zero), Pos(x8), x9, x10)
new_mkBalBranch6MkBalBranch0111(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch51(x0, x1, EmptyFM, x2, x3, x4, x5)
new_mkBalBranch6MkBalBranch330(x0, x1, x2, x3, Zero, Zero, x4, x5)
new_mkBalBranch6MkBalBranch1138(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Succ(x12), x13, x14)
new_mkBalBranch6MkBalBranch327(x0, x1, x2, x3, Neg(Succ(x4)), x5, x6)
new_mkBalBranch6MkBalBranch357(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch0144(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch119(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, Succ(x14), x15, x16)
new_mkBalBranch6MkBalBranch0127(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch375(x0, x1, x2, x3, x4, x5, x6, x7, Neg(Zero), x8, x9)
new_mkBalBranch6MkBalBranch0135(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Succ(x10), x11, x12)
new_mkBalBranch6MkBalBranch382(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11)
new_mkBalBranch6MkBalBranch0127(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, Zero, x9, x10)
new_mkBalBranch6MkBalBranch0119(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch0123(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch1139(x0, x1, x2, x3, x4, x5, x6, x7, Neg(Zero), Neg(x8), x9, x10)
new_mkBalBranch6Size_r1(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch397(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch1182(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, Zero, x14, x15)
new_mkBalBranch6MkBalBranch325(x0, x1, x2, x3, x4, x5, x6, Branch(x7, x8, x9, x10, x11), x12, x13)
new_mkBalBranch6MkBalBranch354(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9, x10)
new_mkBalBranch6MkBalBranch1120(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Pos(Succ(x13)), Neg(x14), x15, x16)
new_mkBalBranch6MkBalBranch0115(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_mkBalBranch6MkBalBranch1120(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Neg(Succ(x13)), Pos(x14), x15, x16)
new_mkBalBranch6MkBalBranch385(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch423(x0, x1, x2, x3, x4, x5, x6, x7, Neg(x8), x9, x10)
new_mkBalBranch6MkBalBranch422(x0, x1, x2, x3, x4, x5, x6, x7, Neg(x8), x9, x10)
new_mkBalBranch6MkBalBranch358(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_mkBalBranch6MkBalBranch1184(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Zero, x13, x14)
new_mkBalBranch6MkBalBranch0151(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), Succ(x9), x10, x11)
new_primMulNat(Zero)
new_mkBalBranch6MkBalBranch1135(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13)
new_mkBalBranch6MkBalBranch1139(x0, x1, x2, x3, x4, x5, x6, x7, Pos(Succ(x8)), Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch1123(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Zero, x13, x14)
new_mkBalBranch6MkBalBranch1153(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, Branch(x11, x12, x13, x14, x15), x16, x17)
new_mkBalBranch6MkBalBranch1177(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Succ(x12), x13, x14)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, Pos(Succ(x8)), Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch0120(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch316(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Succ(x9)), x10, x11)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, Pos(Zero), Neg(x8), x9, x10)
new_mkBalBranch6MkBalBranch0138(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, Neg(Zero), Pos(x8), x9, x10)
new_mkBalBranch6MkBalBranch1156(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Zero, x13, x14)
new_mkBalBranch6MkBalBranch014(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Succ(x9)), Neg(x10), x11, x12)
new_mkBalBranch6MkBalBranch334(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_mkBalBranch6MkBalBranch0126(x0, x1, x2, x3, Branch(x4, x5, x6, x7, x8), x9, x10, x11, x12, x13)
new_mkBalBranch6MkBalBranch1164(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Succ(x12), Succ(x13), x14, x15)
new_mkBalBranch6MkBalBranch1180(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Neg(Succ(x13)), Neg(x14), x15, x16)
new_mkBalBranch6MkBalBranch1183(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16)
new_mkBalBranch6MkBalBranch355(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch426(x0, x1, x2, x3, Zero, x4, x5)
new_mkBalBranch6MkBalBranch0125(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_primPlusNat0(Zero, Succ(x0))
new_mkBalBranch6MkBalBranch327(x0, x1, x2, x3, Neg(Zero), x4, x5)
new_mkBalBranch6MkBalBranch0145(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11, x12)
new_mkBalBranch6MkBalBranch326(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch356(x0, x1, x2, x3, x4, x5, x6, x7, Pos(x8), x9, x10)
new_mkBalBranch6MkBalBranch1143(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_mkBalBranch6MkBalBranch0122(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), Zero, x10, x11)
new_mkBalBranch6MkBalBranch349(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch0134(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12)
new_mkBalBranch6MkBalBranch1121(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16)
new_mkBalBranch6MkBalBranch379(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch0132(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch0115(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch359(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Neg(x10), x11, x12)
new_mkBalBranch6MkBalBranch352(x0, x1, x2, x3, Pos(x4), x5, x6)
new_mkBalBranch6MkBalBranch119(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, Zero, x14, x15)
new_mkBalBranch6MkBalBranch387(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12)
new_mkBalBranch6MkBalBranch374(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Zero), x9, x10)
new_mkBalBranch6MkBalBranch373(x0, x1, x2, x3, x4, x5, x6, x7)
new_mkBalBranch6MkBalBranch376(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11)
new_mkBalBranch6MkBalBranch0137(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12)
new_mkBalBranch6MkBalBranch0110(x0, x1, x2, x3, x4, x5, x6, x7, Zero, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch422(x0, x1, x2, x3, x4, x5, x6, x7, Pos(x8), x9, x10)
new_mkBalBranch6MkBalBranch1176(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15)
new_mkBalBranch6MkBalBranch1140(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11)
new_primPlusInt(Neg(x0), x1, x2, x3, x4, x5)
new_mkBalBranch6MkBalBranch413(x0, x1, x2, x3, Succ(x4), x5, x6)
new_mkBalBranch6MkBalBranch1134(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Succ(x12), Zero, x13, x14)
new_mkBalBranch6MkBalBranch320(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Pos(x10), x11, x12)
new_mkBalBranch6MkBalBranch1170(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Succ(x13), x14, x15)
new_mkBalBranch6MkBalBranch1163(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Succ(x12), x13, x14, x15)
new_mkBalBranch6MkBalBranch346(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch3100(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch384(x0, x1, x2, x3, Succ(x4), x5, x6)
new_mkBalBranch6MkBalBranch1168(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Neg(Zero), Neg(x12), x13, x14)
new_mkBalBranch6MkBalBranch324(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch1111(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13)
new_mkBalBranch6MkBalBranch0155(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch1119(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Zero, x13, x14)
new_mkBalBranch6MkBalBranch014(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Succ(x9)), Pos(x10), x11, x12)
new_mkBalBranch6MkBalBranch317(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Neg(x10), x11, x12)
new_mkBalBranch6MkBalBranch341(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch1159(x0, x1, x2, x3, x4, x5, x6, EmptyFM, x7, x8)
new_mkBalBranch6MkBalBranch1180(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Neg(Succ(x13)), Pos(x14), x15, x16)
new_mkBalBranch6MkBalBranch1180(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Pos(Succ(x13)), Neg(x14), x15, x16)
new_mkBalBranch6MkBalBranch414(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_mkBalBranch6MkBalBranch0136(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Succ(x9)), Neg(x10), x11, x12)
new_mkBalBranch6MkBalBranch1138(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Zero, x12, x13)
new_mkBalBranch6MkBalBranch0140(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12)
new_mkBalBranch6Size_l2(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch0148(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch324(x0, x1, x2, x3, x4, x5, x6, x7, Zero, Zero, x8, x9)
new_mkBalBranch6MkBalBranch379(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch392(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch1132(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14)
new_mkBalBranch6MkBalBranch0121(x0, x1, x2, x3, x4, EmptyFM, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch363(x0, x1, x2, x3, Zero, x4, x5)
new_mkBalBranch6MkBalBranch1172(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15)
new_mkBalBranch6MkBalBranch1168(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Neg(Succ(x12)), Pos(x13), x14, x15)
new_mkBalBranch6MkBalBranch1168(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Pos(Succ(x12)), Neg(x13), x14, x15)
new_mkBalBranch6MkBalBranch0117(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch371(x0, x1, x2, x3, Succ(x4), x5, x6)
new_mkBalBranch6MkBalBranch1173(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10, x11)
new_mkBalBranch6MkBalBranch310(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12)
new_mkBalBranch6MkBalBranch0118(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_mkBalBranch6MkBalBranch0136(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Zero), Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch50(x0, x1, x2, x3, x4, Pos(Zero), x5, x6)
new_mkBalBranch6MkBalBranch424(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch51(x0, x1, Branch(x2, x3, Neg(Zero), x4, x5), x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch1120(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Pos(Zero), Pos(x13), x14, x15)
new_mkBalBranch6MkBalBranch421(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch313(x0, x1, x2, x3, x4, Succ(x5), x6, x7)
new_mkBalBranch6MkBalBranch390(x0, x1, x2, x3, x4, x5, x6, x7, Pos(Zero), x8, x9)
new_mkBalBranch6MkBalBranch3100(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(x9), x10, x11)
new_primPlusNat0(Zero, Zero)
new_mkBalBranch6MkBalBranch014(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Zero), Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch014(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Zero), Neg(x9), x10, x11)
new_mkBalBranch6Size_r3(x0, x1, x2, x3, x4, x5, x6, x7, x8)
new_mkBalBranch6MkBalBranch357(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_mkBalBranch6MkBalBranch398(x0, x1, x2, x3, x4, x5, x6, x7, Neg(x8), x9, x10)
new_mkBalBranch6MkBalBranch1146(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch323(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch370(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch364(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch1164(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Succ(x12), Zero, x13, x14)
new_mkBalBranch6MkBalBranch1139(x0, x1, x2, x3, x4, x5, x6, x7, Pos(Zero), Pos(x8), x9, x10)
new_mkBalBranch6MkBalBranch014(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Succ(x9)), Neg(x10), x11, x12)
new_mkBalBranch6MkBalBranch014(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Succ(x9)), Pos(x10), x11, x12)
new_deleteMax0(x0, x1, x2, x3, Branch(x4, x5, x6, x7, x8), x9, x10)
new_mkBalBranch6MkBalBranch396(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11, x12)
new_mkBalBranch6MkBalBranch1180(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Neg(Zero), Neg(x13), x14, x15)
new_mkBalBranch6MkBalBranch398(x0, x1, x2, x3, x4, x5, x6, x7, Pos(x8), x9, x10)
new_mkBalBranch6MkBalBranch1179(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Zero, x13, x14)
new_mkBalBranch6MkBalBranch0113(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch386(x0, x1, x2, x3, x4, x5, x6, x7, EmptyFM, x8, x9)
new_mkBalBranch6MkBalBranch316(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Zero), x9, x10)
new_mkBalBranch6MkBalBranch51(x0, x1, Branch(x2, x3, Neg(Succ(x4)), x5, x6), x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch3101(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), Succ(x10), x11, x12)
new_mkBalBranch6MkBalBranch1180(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Pos(Zero), Neg(x13), x14, x15)
new_mkBalBranch6MkBalBranch1180(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Neg(Zero), Pos(x13), x14, x15)
new_mkBalBranch6MkBalBranch388(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Succ(x10), x11, x12)
new_mkBalBranch6MkBalBranch390(x0, x1, x2, x3, x4, x5, x6, x7, Neg(Succ(x8)), x9, x10)
new_mkBalBranch6MkBalBranch325(x0, x1, x2, x3, x4, x5, x6, EmptyFM, x7, x8)
new_mkBalBranch6MkBalBranch48(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), Succ(x10), x11, x12)
new_mkBalBranch6MkBalBranch1110(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15)
new_mkBalBranch6MkBalBranch0156(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch3103(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch1178(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Succ(x12), x13, x14)
new_mkBalBranch6MkBalBranch353(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch418(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11)
new_mkBalBranch6MkBalBranch425(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), Zero, x10, x11)
new_deleteMax0(x0, x1, x2, x3, EmptyFM, x4, x5)
new_mkBalBranch6MkBalBranch0110(x0, x1, x2, x3, x4, x5, x6, x7, Zero, Zero, x8, x9)
new_mkBalBranch6MkBalBranch1184(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Succ(x13), x14, x15)
new_mkBalBranch6MkBalBranch380(x0, x1, x2, x3, x4, x5)
new_mkBalBranch6MkBalBranch316(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Zero), x9, x10)
new_mkBalBranch6MkBalBranch48(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), Zero, x10, x11)
new_mkBalBranch6Size_r2(x0, x1, x2, x3, x4, x5, x6, x7, x8)
new_mkBalBranch6MkBalBranch354(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10, x11)
new_mkBalBranch6MkBalBranch316(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Succ(x9)), x10, x11)
new_mkBalBranch6MkBalBranch115(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Zero, Zero, x13, x14)
new_mkBalBranch6MkBalBranch388(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Zero, x10, x11)
new_mkBalBranch6MkBalBranch366(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), Succ(x10), x11, x12)
new_mkBalBranch6MkBalBranch1120(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Neg(Zero), Pos(x13), x14, x15)
new_mkBalBranch6MkBalBranch1120(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Pos(Zero), Neg(x13), x14, x15)
new_mkBalBranch6MkBalBranch0132(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_primPlusInt2(Neg(x0), x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch386(x0, x1, x2, x3, x4, x5, x6, x7, Branch(x8, x9, x10, x11, x12), x13, x14)
new_mkBalBranch6MkBalBranch51(x0, x1, Branch(x2, x3, Pos(Succ(x4)), x5, x6), x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch1122(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Succ(x13), x14, x15)
new_mkBalBranch6MkBalBranch332(x0, x1, x2, x3, x4, x5)
new_mkBalBranch6MkBalBranch377(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch338(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch1137(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Zero, Zero, x13, x14)
new_mkBalBranch6MkBalBranch1147(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch365(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11)
new_mkBalBranch6MkBalBranch374(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Zero), x9, x10)
new_mkBalBranch6MkBalBranch331(x0, x1, x2, Branch(x3, x4, x5, x6, x7), x8, x9)
new_mkBalBranch6MkBalBranch0152(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11)
new_mkBalBranch6MkBalBranch1112(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15)
new_mkBalBranch6MkBalBranch0136(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Succ(x9)), Neg(x10), x11, x12)
new_mkBalBranch6MkBalBranch0136(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Succ(x9)), Pos(x10), x11, x12)
new_mkBalBranch6MkBalBranch412(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11)
new_mkBalBranch6MkBalBranch1120(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Neg(Succ(x13)), Neg(x14), x15, x16)
new_mkBalBranch6MkBalBranch331(x0, x1, x2, EmptyFM, x3, x4)
new_mkBalBranch6MkBalBranch0127(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), Zero, x10, x11)
new_mkBalBranch6MkBalBranch390(x0, x1, x2, x3, x4, x5, x6, x7, Pos(Succ(x8)), x9, x10)
new_mkBalBranch6MkBalBranch1118(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Succ(x13), x14, x15, x16)
new_mkBalBranch6MkBalBranch340(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch420(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch0141(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12)
new_mkBalBranch6MkBalBranch0147(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch1157(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Branch(x12, x13, x14, x15, x16), x17, x18)
new_mkBalBranch6MkBalBranch427(x0, x1, x2, x3, Neg(x4), x5, x6)
new_mkBalBranch6MkBalBranch1152(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch351(x0, x1, x2, x3, x4, Pos(x5), x6, x7)
new_mkBalBranch6MkBalBranch0150(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10, x11)
new_mkBalBranch6MkBalBranch370(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_mkBalBranch6MkBalBranch1179(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Succ(x13), x14, x15)
new_mkBalBranch6MkBalBranch45(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch355(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), Zero, x9, x10)
new_mkBalBranch6MkBalBranch0118(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, Pos(Zero), Pos(x8), x9, x10)
new_mkBalBranch6MkBalBranch1133(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14)
new_mkBalBranch6MkBalBranch358(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch0127(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), Succ(x10), x11, x12)
new_mkBalBranch6MkBalBranch333(x0, x1, x2, x3, x4, x5)
new_mkBalBranch6MkBalBranch0133(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch49(x0, x1, x2, x3, x4, x5)
new_primMulNat1(Succ(x0))
new_mkBalBranch6MkBalBranch426(x0, x1, x2, x3, Succ(x4), x5, x6)
new_mkBalBranch6MkBalBranch348(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch1157(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, EmptyFM, x12, x13)
new_mkBalBranch6MkBalBranch1156(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Succ(x13), x14, x15)
new_mkBalBranch6MkBalBranch1155(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13)
new_mkBalBranch6MkBalBranch313(x0, x1, x2, x3, x4, Zero, x5, x6)
new_mkBalBranch6MkBalBranch361(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12)
new_mkBalBranch6MkBalBranch1168(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Neg(Zero), Pos(x12), x13, x14)
new_mkBalBranch6MkBalBranch1168(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Pos(Zero), Neg(x12), x13, x14)
new_mkBalBranch6MkBalBranch375(x0, x1, x2, x3, x4, x5, x6, x7, Pos(Succ(x8)), x9, x10)
new_mkBalBranch6MkBalBranch1130(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Neg(Succ(x12)), Pos(x13), x14, x15)
new_mkBalBranch6MkBalBranch0114(x0, x1, x2, x3, Branch(x4, x5, x6, x7, x8), x9, x10, x11, x12, x13)
new_mkBalBranch6MkBalBranch1130(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Pos(Succ(x12)), Neg(x13), x14, x15)
new_mkBalBranch6MkBalBranch394(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch0155(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch391(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch0130(x0, x1, x2, x3, x4, x5, x6, x7, Pos(Succ(x8)), Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch362(x0, x1, x2, x3, Zero, x4, x5)
new_mkBalBranch6MkBalBranch347(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch1131(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Zero, x13, x14)
new_mkBalBranch6MkBalBranch1146(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_mkBalBranch6MkBalBranch3104(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11)
new_mkBalBranch6MkBalBranch1167(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15)
new_mkBalBranch6MkBalBranch0157(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11, x12)
new_mkBalBranch6MkBalBranch50(x0, x1, x2, x3, x4, Pos(Succ(Succ(Zero))), x5, x6)
new_mkBalBranch6MkBalBranch385(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch0122(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch52(x0, x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch427(x0, x1, x2, x3, Pos(x4), x5, x6)
new_mkBalBranch6MkBalBranch360(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12)
new_mkBalBranch6MkBalBranch1151(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch416(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11)
new_mkBalBranch6MkBalBranch345(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch3103(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_primPlusInt0(x0, Pos(x1))
new_mkBalBranch6MkBalBranch330(x0, x1, x2, x3, Succ(x4), Succ(x5), x6, x7)
new_mkBalBranch6MkBalBranch343(x0, x1, x2, x3, x4, Neg(x5), x6, x7)
new_mkBalBranch6MkBalBranch378(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch1152(x0, x1, x2, x3, x4, x5, x6, x7, Zero, Zero, x8, x9)
new_mkBalBranch6MkBalBranch115(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Succ(x13), Succ(x14), x15, x16)
new_mkBalBranch6MkBalBranch425(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), Succ(x10), x11, x12)
new_mkBalBranch6Size_l0(x0, x1, x2, x3, x4)
new_mkBalBranch6MkBalBranch47(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch317(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Pos(x10), x11, x12)
new_mkBalBranch6MkBalBranch395(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11, x12)
new_mkBalBranch6MkBalBranch1134(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Zero, Succ(x12), x13, x14)
new_mkBalBranch6MkBalBranch0133(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_mkBalBranch6MkBalBranch1130(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Pos(Succ(x12)), Pos(x13), x14, x15)
new_mkBalBranch6MkBalBranch334(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch6Size_l(x0, x1, x2, x3, x4, x5)
new_mkBalBranch6MkBalBranch1160(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15)
new_mkBalBranch6MkBalBranch423(x0, x1, x2, x3, x4, x5, x6, x7, Pos(x8), x9, x10)
new_mkBalBranch6MkBalBranch0147(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_mkBalBranch6MkBalBranch1161(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Zero, x13, x14)
new_mkBalBranch6MkBalBranch1114(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15)
new_mkBalBranch6MkBalBranch1126(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Zero, x13, x14)
new_mkBalBranch6MkBalBranch359(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Pos(x10), x11, x12)
new_mkBalBranch6MkBalBranch389(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch48(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, Zero, x9, x10)
new_mkBalBranch6MkBalBranch378(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch1130(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Pos(Zero), Pos(x12), x13, x14)
new_mkBalBranch6MkBalBranch37(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Succ(x10), x11, x12)
new_mkBalBranch6MkBalBranch324(x0, x1, x2, x3, x4, x5, x6, x7, Zero, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch1173(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9, x10)
new_mkBalBranch6MkBalBranch1130(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Pos(Zero), Neg(x12), x13, x14)
new_mkBalBranch6MkBalBranch1130(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Neg(Zero), Pos(x12), x13, x14)
new_primMinusNat0(Succ(x0), Zero)
new_mkBalBranch6MkBalBranch0143(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch347(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch311(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch1116(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16)
new_mkBalBranch6MkBalBranch318(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch3101(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch371(x0, x1, x2, x3, Zero, x4, x5)
new_mkBalBranch6MkBalBranch1120(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Neg(Zero), Neg(x13), x14, x15)
new_mkBalBranch6MkBalBranch368(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9, x10)
new_mkBalBranch6MkBalBranch366(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, Zero, x9, x10)
new_mkBalBranch6MkBalBranch324(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), Zero, x9, x10)
new_primPlusInt2(Pos(x0), x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch318(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch383(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch399(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch390(x0, x1, x2, x3, x4, x5, x6, x7, Neg(Zero), x8, x9)
new_mkBalBranch6MkBalBranch1(x0, x1, x2, x3, x4, x5, x6, x7, EmptyFM, x8, x9)
new_mkBalBranch6MkBalBranch0110(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), Zero, x9, x10)
new_mkBalBranch6MkBalBranch0122(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, Zero, x9, x10)
new_mkBalBranch6MkBalBranch1144(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11)
new_mkBalBranch6MkBalBranch1174(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Succ(x12), x13, x14)
new_mkBalBranch6MkBalBranch338(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_mkBalBranch6MkBalBranch1129(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Succ(x13), x14, x15, x16)
new_mkBalBranch6MkBalBranch312(x0, x1, x2, x3, x4, x5, x6, x7)
new_mkBalBranch6MkBalBranch017(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch1175(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, Branch(x11, x12, x13, x14, x15), x16, x17)
new_mkBalBranch6MkBalBranch374(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Succ(x9)), x10, x11)
new_mkBalBranch6MkBalBranch0146(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11)
new_primPlusNat0(Succ(x0), Zero)
new_mkBalBranch6MkBalBranch328(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11)
new_mkBalBranch6MkBalBranch0126(x0, x1, x2, x3, EmptyFM, x4, x5, x6, x7, x8)
new_primMulNat(Succ(x0))
new_mkBalBranch6MkBalBranch372(x0, x1, x2, x3, Succ(x4), x5, x6, x7)
new_mkBalBranch6MkBalBranch1139(x0, x1, x2, x3, x4, x5, x6, x7, Neg(Succ(x8)), Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch1158(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch0156(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_mkBalBranch6MkBalBranch38(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Pos(x10), x11, x12)
new_mkBalBranch6MkBalBranch0151(x0, x1, x2, x3, x4, x5, x6, x7, Zero, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch322(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12)
new_mkBalBranch6MkBalBranch336(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_mkBalBranch6MkBalBranch0114(x0, x1, x2, x3, EmptyFM, x4, x5, x6, x7, x8)
new_mkBalBranch6MkBalBranch369(x0, x1, x2, x3, x4, x5, x6, x7, Neg(x8), x9, x10)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, Neg(Succ(x8)), Neg(x9), x10, x11)
new_mkBalBranch6Size_r(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch44(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch1(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_primPlusInt(Pos(x0), x1, x2, x3, x4, x5)
new_mkBalBranch6MkBalBranch428(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch1152(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), Zero, x9, x10)
new_sizeFM(Branch(x0, x1, x2, x3, x4), x5, x6)
new_mkBalBranch6MkBalBranch3101(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), Zero, x10, x11)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, Neg(Succ(x8)), Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, Pos(Succ(x8)), Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch413(x0, x1, x2, x3, Zero, x4, x5)
new_mkBalBranch6MkBalBranch315(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch1125(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16)
new_mkBalBranch6MkBalBranch375(x0, x1, x2, x3, x4, x5, x6, x7, Pos(Zero), x8, x9)
new_mkBalBranch6MkBalBranch1117(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16)
new_mkBalBranch6MkBalBranch0143(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch1181(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Zero, x12, x13)
new_mkBalBranch6MkBalBranch1130(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Neg(Zero), Neg(x12), x13, x14)
new_mkBalBranch6MkBalBranch53(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch1154(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Succ(x12), x13, x14)
new_mkBalBranch6MkBalBranch1124(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16)
new_mkBalBranch6MkBalBranch0150(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9, x10)
new_mkBalBranch6MkBalBranch0124(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch366(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch1143(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch0112(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch0139(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch1150(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch366(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), Zero, x10, x11)
new_mkBalBranch6MkBalBranch424(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_mkBalBranch6MkBalBranch372(x0, x1, x2, x3, Zero, x4, x5, x6)
new_mkBalBranch6MkBalBranch0139(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch351(x0, x1, x2, x3, x4, Neg(x5), x6, x7)
new_mkBalBranch6MkBalBranch1151(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_primMinusNat0(Zero, Succ(x0))
new_mkBalBranch6MkBalBranch0153(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Succ(x10), x11, x12)
new_mkBalBranch6MkBalBranch1145(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11)
new_mkBalBranch6MkBalBranch421(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_mkBalBranch6MkBalBranch017(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch1136(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13)
new_mkBalBranch6MkBalBranch414(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch39(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12)
new_mkBalBranch6MkBalBranch0136(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Zero), Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch393(x0, x1, x2, x3, x4, x5, x6, x7, Neg(x8), x9, x10)
new_mkBalBranch6MkBalBranch1162(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16)
new_ps(x0, x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch1148(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Branch(x12, x13, x14, x15, x16), x17, x18)
new_mkBalBranch6MkBalBranch350(x0, x1, x2, x3, Pos(x4), x5, x6)
new_mkBalBranch6MkBalBranch356(x0, x1, x2, x3, x4, x5, x6, x7, Neg(x8), x9, x10)
new_mkBalBranch6Size_l4(x0, x1, x2, x3, x4, x5, x6, x7, x8)
new_mkBalBranch6MkBalBranch1159(x0, x1, x2, x3, x4, x5, x6, Branch(x7, x8, x9, x10, x11), x12, x13)
new_mkBalBranch6MkBalBranch337(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch1126(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Succ(x13), x14, x15)
new_mkBalBranch6MkBalBranch417(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch0149(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_mkBalBranch6MkBalBranch0144(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch37(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Zero, x10, x11)
new_mkBalBranch6MkBalBranch374(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Succ(x9)), x10, x11)
new_mkBalBranch6MkBalBranch1149(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch0124(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_mkBalBranch6MkBalBranch016(x0, x1, x2, x3, x4, EmptyFM, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch0110(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch118(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14)
new_mkBalBranch6MkBalBranch1131(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Succ(x13), x14, x15)
new_mkBalBranch6MkBalBranch342(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch319(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch0131(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch1168(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Pos(Zero), Pos(x12), x13, x14)
new_mkBalBranch6MkBalBranch1137(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Succ(x13), Succ(x14), x15, x16)
new_mkBalBranch6MkBalBranch352(x0, x1, x2, x3, Neg(x4), x5, x6)
new_mkBalBranch6MkBalBranch1113(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13)
new_mkBalBranch6MkBalBranch43(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch0135(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Zero, x10, x11)
new_mkBalBranch6MkBalBranch0142(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch1115(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13)
new_mkBalBranch6MkBalBranch397(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch0159(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11)
new_mkBalBranch6MkBalBranch3101(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, Zero, x9, x10)
new_mkBalBranch6MkBalBranch425(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, Zero, x9, x10)
new_mkBalBranch6Size_r0(x0, x1, x2, x3, x4)
new_mkBalBranch6MkBalBranch1120(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Pos(Succ(x13)), Pos(x14), x15, x16)
new_mkBalBranch6MkBalBranch362(x0, x1, x2, x3, Succ(x4), x5, x6)
new_mkBalBranch6MkBalBranch36(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12)
new_mkBalBranch6MkBalBranch1134(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Succ(x12), Succ(x13), x14, x15)
new_mkBalBranch6MkBalBranch1165(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Zero, x12, x13)
new_mkBalBranch6MkBalBranch0154(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch117(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14)
new_mkBalBranch6MkBalBranch327(x0, x1, x2, x3, Pos(Zero), x4, x5)
new_mkBalBranch6MkBalBranch0145(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10, x11)
new_mkBalBranch6MkBalBranch415(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch0151(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), Zero, x9, x10)
new_mkBalBranch6MkBalBranch355(x0, x1, x2, x3, x4, x5, x6, x7, Zero, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch0130(x0, x1, x2, x3, x4, x5, x6, x7, Neg(Zero), Neg(x8), x9, x10)
new_mkBalBranch6Size_l3(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch50(x0, x1, x2, x3, x4, Pos(Succ(Zero)), x5, x6)
new_mkBalBranch6MkBalBranch014(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Zero), Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch396(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10, x11)
new_mkBalBranch6MkBalBranch1170(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Zero, x13, x14)
new_mkBalBranch6MkBalBranch1129(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Zero, x13, x14, x15)
new_mkBalBranch6MkBalBranch115(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Zero, Succ(x13), x14, x15)
new_mkBalBranch6MkBalBranch377(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch0154(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch1168(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Neg(Succ(x12)), Neg(x13), x14, x15)
new_mkBalBranch6MkBalBranch335(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch1139(x0, x1, x2, x3, x4, x5, x6, x7, Neg(Succ(x8)), Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch1139(x0, x1, x2, x3, x4, x5, x6, x7, Pos(Succ(x8)), Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch1164(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Zero, Zero, x12, x13)
new_mkBalBranch6MkBalBranch383(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch329(x0, x1, x2, x3, x4, x5, x6, Branch(x7, x8, x9, x10, x11), x12, x13)
new_mkBalBranch6MkBalBranch0138(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch419(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch1119(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Succ(x13), x14, x15)
new_mkBalBranch6MkBalBranch417(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch1137(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Succ(x13), Zero, x14, x15)
new_mkBalBranch6MkBalBranch1(x0, x1, x2, x3, x4, x5, x6, x7, Branch(x8, x9, x10, x11, x12), x13, x14)
new_mkBalBranch6MkBalBranch1169(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Succ(x12), x13, x14)
new_mkBalBranch6MkBalBranch1142(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_mkBalBranch6MkBalBranch0153(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Zero, x10, x11)
new_mkBalBranch6MkBalBranch116(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14)
new_mkBalBranch6MkBalBranch1166(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Zero, x12, x13, x14)
new_mkBalBranch6MkBalBranch1142(x0, x1, x2, x3, x4, x5, x6, x7, Succ(x8), x9, x10)
new_mkBalBranch6MkBalBranch1154(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, Zero, x12, x13)
new_mkBalBranch6MkBalBranch115(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Succ(x13), Zero, x14, x15)
new_mkBalBranch6MkBalBranch393(x0, x1, x2, x3, x4, x5, x6, x7, Pos(x8), x9, x10)
new_primPlusNat0(Succ(x0), Succ(x1))
new_mkBalBranch6MkBalBranch50(x0, x1, x2, x3, x4, Neg(Zero), x5, x6)
new_mkBalBranch6MkBalBranch0116(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9, x10)
new_mkBalBranch6MkBalBranch343(x0, x1, x2, x3, x4, Pos(x5), x6, x7)
new_primPlusInt1(x0, Pos(x1))
new_mkBalBranch6MkBalBranch1171(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15)
new_mkBalBranch6MkBalBranch0158(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11)
new_mkBalBranch6MkBalBranch44(x0, x1, x2, x3, x4, x5, x6, x7, Zero, x8, x9)
new_mkBalBranch6MkBalBranch1137(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, Zero, Succ(x13), x14, x15)
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch0(wvu1492, wvu1493, wvu1495, wvu14960, wvu14961, wvu14962, wvu14963, wvu14964, h, ba) → new_deleteMax(wvu14960, wvu14961, wvu14962, wvu14963, wvu14964, h, ba)
The graph contains the following edges 4 >= 1, 5 >= 2, 6 >= 3, 7 >= 4, 8 >= 5, 9 >= 6, 10 >= 7
- new_mkBalBranch0(wvu1492, wvu1493, wvu1495, wvu14960, wvu14961, wvu14962, wvu14963, wvu14964, h, ba) → new_mkBalBranch6MkBalBranch5(wvu1492, wvu1493, wvu14960, wvu14961, wvu14962, wvu14963, wvu14964, wvu1495, new_ps(wvu1492, wvu1493, new_deleteMax0(wvu14960, wvu14961, wvu14962, wvu14963, wvu14964, h, ba), wvu1495, wvu1495, h, ba), h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 4 >= 3, 5 >= 4, 6 >= 5, 7 >= 6, 8 >= 7, 3 >= 8, 9 >= 10, 10 >= 11
- new_deleteMax(wvu14960, wvu14961, wvu14962, wvu14963, Branch(wvu149640, wvu149641, wvu149642, wvu149643, wvu149644), h, ba) → new_mkBalBranch0(wvu14960, wvu14961, wvu14963, wvu149640, wvu149641, wvu149642, wvu149643, wvu149644, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 4 >= 3, 5 > 4, 5 > 5, 5 > 6, 5 > 7, 5 > 8, 6 >= 9, 7 >= 10
- new_mkBalBranch6MkBalBranch5(wvu1492, wvu1493, wvu14960, wvu14961, wvu14962, wvu14963, Branch(wvu149640, wvu149641, wvu149642, wvu149643, wvu149644), wvu1495, wvu1827, h, ba) → new_mkBalBranch0(wvu14960, wvu14961, wvu14963, wvu149640, wvu149641, wvu149642, wvu149643, wvu149644, h, ba)
The graph contains the following edges 3 >= 1, 4 >= 2, 6 >= 3, 7 > 4, 7 > 5, 7 > 6, 7 > 7, 7 > 8, 10 >= 9, 11 >= 10
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_deleteMax1(wvu3340, wvu3341, wvu3342, wvu3343, Branch(wvu33440, wvu33441, wvu33442, wvu33443, wvu33444), h) → new_mkBalBranch2(wvu3340, wvu3341, wvu3343, wvu33440, wvu33441, wvu33442, wvu33443, wvu33444, h)
new_mkBalBranch2(wvu330, wvu331, wvu333, wvu3340, wvu3341, wvu3342, wvu3343, wvu3344, h) → new_deleteMax1(wvu3340, wvu3341, wvu3342, wvu3343, wvu3344, h)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch2(wvu330, wvu331, wvu333, wvu3340, wvu3341, wvu3342, wvu3343, wvu3344, h) → new_deleteMax1(wvu3340, wvu3341, wvu3342, wvu3343, wvu3344, h)
The graph contains the following edges 4 >= 1, 5 >= 2, 6 >= 3, 7 >= 4, 8 >= 5, 9 >= 6
- new_deleteMax1(wvu3340, wvu3341, wvu3342, wvu3343, Branch(wvu33440, wvu33441, wvu33442, wvu33443, wvu33444), h) → new_mkBalBranch2(wvu3340, wvu3341, wvu3343, wvu33440, wvu33441, wvu33442, wvu33443, wvu33444, h)
The graph contains the following edges 1 >= 1, 2 >= 2, 4 >= 3, 5 > 4, 5 > 5, 5 > 6, 5 > 7, 5 > 8, 6 >= 9
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch3(wvu1487, wvu1488, wvu14900, wvu14901, wvu14902, Branch(wvu149030, wvu149031, wvu149032, wvu149033, wvu149034), wvu14904, wvu1491, h, ba) → new_mkBalBranch3(wvu14900, wvu14901, wvu149030, wvu149031, wvu149032, wvu149033, wvu149034, wvu14904, h, ba)
new_mkBalBranch3(wvu1487, wvu1488, wvu14900, wvu14901, wvu14902, wvu14903, wvu14904, wvu1491, h, ba) → new_deleteMin0(wvu14900, wvu14901, wvu14902, wvu14903, wvu14904, h, ba)
new_deleteMin0(wvu14900, wvu14901, wvu14902, Branch(wvu149030, wvu149031, wvu149032, wvu149033, wvu149034), wvu14904, h, ba) → new_mkBalBranch3(wvu14900, wvu14901, wvu149030, wvu149031, wvu149032, wvu149033, wvu149034, wvu14904, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch3(wvu1487, wvu1488, wvu14900, wvu14901, wvu14902, Branch(wvu149030, wvu149031, wvu149032, wvu149033, wvu149034), wvu14904, wvu1491, h, ba) → new_mkBalBranch3(wvu14900, wvu14901, wvu149030, wvu149031, wvu149032, wvu149033, wvu149034, wvu14904, h, ba)
The graph contains the following edges 3 >= 1, 4 >= 2, 6 > 3, 6 > 4, 6 > 5, 6 > 6, 6 > 7, 7 >= 8, 9 >= 9, 10 >= 10
- new_mkBalBranch3(wvu1487, wvu1488, wvu14900, wvu14901, wvu14902, wvu14903, wvu14904, wvu1491, h, ba) → new_deleteMin0(wvu14900, wvu14901, wvu14902, wvu14903, wvu14904, h, ba)
The graph contains the following edges 3 >= 1, 4 >= 2, 5 >= 3, 6 >= 4, 7 >= 5, 9 >= 6, 10 >= 7
- new_deleteMin0(wvu14900, wvu14901, wvu14902, Branch(wvu149030, wvu149031, wvu149032, wvu149033, wvu149034), wvu14904, h, ba) → new_mkBalBranch3(wvu14900, wvu14901, wvu149030, wvu149031, wvu149032, wvu149033, wvu149034, wvu14904, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 4 > 3, 4 > 4, 4 > 5, 4 > 6, 4 > 7, 5 >= 8, 6 >= 9, 7 >= 10
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2GlueBal1(wvu2383, wvu2384, wvu2385, wvu2386, wvu2387, wvu2388, wvu2389, wvu2390, wvu2391, wvu2392, Succ(wvu23930), Succ(wvu23940), h, ba) → new_glueBal2GlueBal1(wvu2383, wvu2384, wvu2385, wvu2386, wvu2387, wvu2388, wvu2389, wvu2390, wvu2391, wvu2392, wvu23930, wvu23940, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2GlueBal1(wvu2383, wvu2384, wvu2385, wvu2386, wvu2387, wvu2388, wvu2389, wvu2390, wvu2391, wvu2392, Succ(wvu23930), Succ(wvu23940), h, ba) → new_glueBal2GlueBal1(wvu2383, wvu2384, wvu2385, wvu2386, wvu2387, wvu2388, wvu2389, wvu2390, wvu2391, wvu2392, wvu23930, wvu23940, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 11 > 11, 12 > 12, 13 >= 13, 14 >= 14
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2GlueBal10(wvu1487, wvu1488, wvu1489, wvu1490, wvu1491, wvu1492, wvu1493, wvu1494, wvu1495, wvu1496, Succ(wvu14970), Succ(wvu14980), h, ba) → new_glueBal2GlueBal10(wvu1487, wvu1488, wvu1489, wvu1490, wvu1491, wvu1492, wvu1493, wvu1494, wvu1495, wvu1496, wvu14970, wvu14980, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2GlueBal10(wvu1487, wvu1488, wvu1489, wvu1490, wvu1491, wvu1492, wvu1493, wvu1494, wvu1495, wvu1496, Succ(wvu14970), Succ(wvu14980), h, ba) → new_glueBal2GlueBal10(wvu1487, wvu1488, wvu1489, wvu1490, wvu1491, wvu1492, wvu1493, wvu1494, wvu1495, wvu1496, wvu14970, wvu14980, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 11 > 11, 12 > 12, 13 >= 13, 14 >= 14
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ DependencyGraphProof
Q DP problem:
The TRS P consists of the following rules:
new_delFromFM(Branch(False, wvu31, wvu32, wvu33, wvu34), True, h) → new_delFromFM(wvu34, True, h)
new_delFromFM(Branch(True, wvu31, wvu32, wvu33, wvu34), False, h) → new_delFromFM(wvu33, False, h)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 2 SCCs.
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_delFromFM(Branch(True, wvu31, wvu32, wvu33, wvu34), False, h) → new_delFromFM(wvu33, False, h)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_delFromFM(Branch(True, wvu31, wvu32, wvu33, wvu34), False, h) → new_delFromFM(wvu33, False, h)
The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
Q DP problem:
The TRS P consists of the following rules:
new_delFromFM(Branch(False, wvu31, wvu32, wvu33, wvu34), True, h) → new_delFromFM(wvu34, True, h)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_delFromFM(Branch(False, wvu31, wvu32, wvu33, wvu34), True, h) → new_delFromFM(wvu34, True, h)
The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3